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-WithArrays.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:52:43,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:52:43,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:52:43,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:52:43,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:52:43,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:52:43,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:52:43,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:52:43,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:52:43,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:52:43,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:52:43,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:52:43,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:52:43,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:52:43,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:52:43,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:52:43,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:52:43,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:52:43,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:52:43,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:52:43,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:52:43,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:52:43,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:52:43,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:52:43,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:52:43,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:52:43,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:52:43,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:52:43,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:52:43,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:52:43,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:52:43,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:52:43,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:52:43,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:52:43,508 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:52:43,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:52:43,510 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:52:43,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:52:43,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:52:43,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:52:43,536 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:52:43,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:52:43,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:52:43,537 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:52:43,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:52:43,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:52:43,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:52:43,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:52:43,603 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:52:43,604 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:52:43,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl [2018-07-25 08:52:43,605 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl' [2018-07-25 08:52:43,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:52:43,654 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:52:43,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:52:43,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:52:43,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:52:43,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,696 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:52:43,696 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:52:43,696 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:52:43,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:52:43,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:52:43,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:52:43,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:52:43,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:52:43,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:52:43,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:52:43,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:52:43,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/1) ... [2018-07-25 08:52:43,811 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 08:52:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 08:52:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 08:52:43,953 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:52:43,954 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:52:43 BoogieIcfgContainer [2018-07-25 08:52:43,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:52:43,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:52:43,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:52:43,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:52:43,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:52:43" (1/2) ... [2018-07-25 08:52:43,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af5d309 and model type Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:52:43, skipping insertion in model container [2018-07-25 08:52:43,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:52:43" (2/2) ... [2018-07-25 08:52:43,963 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-WithArrays.bpl [2018-07-25 08:52:43,974 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:52:43,982 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:52:44,031 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:52:44,032 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:52:44,032 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:52:44,032 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:52:44,032 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:52:44,032 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:52:44,033 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:52:44,033 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:52:44,033 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:52:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:52:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:52:44,056 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,058 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:52:44,059 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-07-25 08:52:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:44,231 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 08:52:44,233 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:52:44,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:52:44,238 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:52:44,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:52:44,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:52:44,254 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:52:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:44,285 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 08:52:44,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:52:44,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 08:52:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:44,303 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:52:44,303 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:52:44,307 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 08:52:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:52:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:52:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:52:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:52:44,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:52:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:44,342 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:52:44,342 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:52:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:52:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:52:44,343 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,343 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:52:44,344 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-07-25 08:52:44,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:44,436 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 08:52:44,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:44,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:52:44,439 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:52:44,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:52:44,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:52:44,440 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 08:52:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:44,459 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:52:44,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:52:44,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:52:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:44,460 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:52:44,460 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:52:44,461 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:52:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:52:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:52:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:52:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:52:44,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:52:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:44,466 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:52:44,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:52:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:52:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:52:44,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,467 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 08:52:44,467 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-07-25 08:52:44,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:44,575 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 08:52:44,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:44,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:52:44,576 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:52:44,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:52:44,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:52:44,577 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 08:52:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:44,594 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:52:44,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:52:44,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:52:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:44,596 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:52:44,596 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:52:44,596 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:52:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:52:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:52:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:52:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:52:44,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:52:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:44,600 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:52:44,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:52:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:52:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:52:44,601 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,601 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 08:52:44,601 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-07-25 08:52:44,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:44,773 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 08:52:44,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:44,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:52:44,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:52:44,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:52:44,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:52:44,775 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:52:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:44,792 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:52:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:52:44,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:52:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:44,793 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:52:44,793 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:52:44,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:52:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:52:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:52:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:52:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:52:44,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:52:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:44,798 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:52:44,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:52:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:52:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:52:44,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:44,799 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 08:52:44,799 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-07-25 08:52:44,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:44,990 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 08:52:44,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:44,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:52:44,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:52:44,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:52:44,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:52:44,993 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 08:52:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,018 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:52:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:52:45,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:52:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,019 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:52:45,020 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:52:45,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:52:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:52:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:52:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:52:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:52:45,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:52:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,025 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:52:45,025 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:52:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:52:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:52:45,026 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,026 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 08:52:45,027 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-07-25 08:52:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,172 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 08:52:45,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:52:45,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:52:45,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:52:45,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:52:45,174 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 08:52:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,200 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:52:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:52:45,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:52:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,204 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:52:45,204 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:52:45,205 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:52:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:52:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:52:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:52:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:52:45,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:52:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,215 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:52:45,215 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:52:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:52:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:52:45,216 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,216 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 08:52:45,216 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-07-25 08:52:45,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,386 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 08:52:45,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:52:45,387 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:52:45,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:52:45,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:52:45,389 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 08:52:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,418 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:52:45,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:52:45,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:52:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,420 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:52:45,420 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:52:45,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:52:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:52:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:52:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:52:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:52:45,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:52:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,430 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:52:45,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:52:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:52:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:52:45,432 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,432 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 08:52:45,433 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-07-25 08:52:45,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,577 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 08:52:45,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:52:45,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:52:45,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:52:45,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:52:45,579 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 08:52:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,606 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:52:45,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:52:45,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 08:52:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,607 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:52:45,607 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:52:45,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:52:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:52:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:52:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:52:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:52:45,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:52:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,619 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:52:45,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:52:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:52:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:52:45,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,620 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 08:52:45,624 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-07-25 08:52:45,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,773 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 08:52:45,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:52:45,775 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:52:45,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:52:45,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:52:45,776 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 08:52:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,790 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:52:45,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:52:45,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 08:52:45,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,792 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:52:45,792 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:52:45,793 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:52:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:52:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:52:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:52:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:52:45,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:52:45,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,797 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:52:45,797 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:52:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:52:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:52:45,798 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,798 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 08:52:45,798 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-07-25 08:52:45,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,921 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 08:52:45,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:52:45,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:52:45,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:52:45,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:52:45,923 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 08:52:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:45,942 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:52:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:52:45,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 08:52:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:45,943 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:52:45,943 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:52:45,944 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:52:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:52:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:52:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:52:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:52:45,948 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:52:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:45,949 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:52:45,949 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:52:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:52:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:52:45,950 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:45,950 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 08:52:45,950 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:45,950 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-07-25 08:52:45,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:46,111 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 08:52:46,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:46,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:52:46,112 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:52:46,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:52:46,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:52:46,113 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 08:52:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,133 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:52:46,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:52:46,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 08:52:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,134 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:52:46,135 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:52:46,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:52:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:52:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:52:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:52:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:52:46,141 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:52:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,142 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:52:46,142 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:52:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:52:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:52:46,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,144 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 08:52:46,145 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-07-25 08:52:46,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:46,349 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 08:52:46,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:46,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:52:46,350 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:52:46,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:52:46,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:52:46,351 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 08:52:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,378 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:52:46,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:52:46,378 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 08:52:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,379 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:52:46,379 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:52:46,380 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:52:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:52:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:52:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:52:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:52:46,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:52:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,385 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:52:46,385 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:52:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:52:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:52:46,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,388 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 08:52:46,388 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-07-25 08:52:46,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:46,577 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 08:52:46,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:46,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:52:46,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:52:46,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:52:46,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:52:46,579 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 08:52:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,602 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:52:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:52:46,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 08:52:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,603 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:52:46,603 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:52:46,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:52:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:52:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:52:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:52:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:52:46,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:52:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,608 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:52:46,609 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:52:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:52:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:52:46,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,610 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 08:52:46,610 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-07-25 08:52:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:46,786 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 08:52:46,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:46,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:52:46,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:52:46,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:52:46,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:52:46,788 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 08:52:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,808 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:52:46,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:52:46,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 08:52:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,809 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:52:46,809 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:52:46,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:52:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:52:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:52:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:52:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:52:46,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:52:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,814 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:52:46,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:52:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:52:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:52:46,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,815 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 08:52:46,815 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-07-25 08:52:46,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:47,016 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 08:52:47,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:47,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:52:47,017 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:52:47,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:52:47,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:52:47,020 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 08:52:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:47,038 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:52:47,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:52:47,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 08:52:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:47,039 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:52:47,040 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:52:47,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:52:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:52:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:52:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:52:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:52:47,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:52:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:47,048 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:52:47,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:52:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:52:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:52:47,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:47,051 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 08:52:47,051 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-07-25 08:52:47,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:47,287 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 08:52:47,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:47,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:52:47,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:52:47,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:52:47,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:52:47,292 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 08:52:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:47,334 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:52:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:52:47,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 08:52:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:47,335 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:52:47,335 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:52:47,336 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:52:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:52:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:52:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:52:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:52:47,342 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:52:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:47,343 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:52:47,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:52:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:52:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:52:47,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:47,344 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 08:52:47,345 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-07-25 08:52:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:47,590 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 08:52:47,591 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:47,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:52:47,592 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:52:47,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:52:47,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:52:47,593 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 08:52:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:47,628 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:52:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:52:47,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 08:52:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:47,629 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:52:47,630 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:52:47,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:52:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:52:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:52:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:52:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:52:47,635 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:52:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:47,636 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:52:47,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:52:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:52:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:52:47,638 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:47,638 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 08:52:47,638 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:47,638 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-07-25 08:52:47,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:47,879 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 08:52:47,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:47,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:52:47,880 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:52:47,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:52:47,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:52:47,881 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 08:52:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:47,904 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:52:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:52:47,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 08:52:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:47,905 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:52:47,905 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:52:47,906 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:52:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:52:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:52:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:52:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:52:47,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:52:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:47,911 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:52:47,911 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:52:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:52:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:52:47,912 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:47,912 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 08:52:47,912 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-07-25 08:52:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:48,156 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 08:52:48,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:48,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:52:48,157 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:52:48,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:52:48,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:52:48,158 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 08:52:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:48,226 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:52:48,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:52:48,233 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 08:52:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:48,233 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:52:48,233 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:52:48,234 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:52:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:52:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:52:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:52:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:52:48,247 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:52:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:48,248 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:52:48,248 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:52:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:52:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:52:48,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:48,249 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 08:52:48,250 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-07-25 08:52:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:48,523 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 08:52:48,523 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:48,524 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:52:48,524 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:52:48,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:52:48,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:52:48,525 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 08:52:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:48,543 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:52:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:52:48,544 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 08:52:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:48,544 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:52:48,545 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:52:48,545 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:52:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:52:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:52:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:52:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:52:48,551 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:52:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:48,551 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:52:48,551 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:52:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:52:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:52:48,552 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:48,552 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 08:52:48,553 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-07-25 08:52:48,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:48,876 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 08:52:48,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:48,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:52:48,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:52:48,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:52:48,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:52:48,878 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 08:52:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:48,907 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:52:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:52:48,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 08:52:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:48,908 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:52:48,908 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:52:48,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:52:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:52:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:52:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:52:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:52:48,913 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:52:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:48,914 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:52:48,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:52:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:52:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:52:48,914 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:48,915 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 08:52:48,915 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-07-25 08:52:48,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:49,184 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 08:52:49,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:49,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:52:49,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:52:49,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:52:49,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:52:49,186 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 08:52:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:49,211 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:52:49,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:52:49,212 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 08:52:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:49,212 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:52:49,212 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:52:49,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:52:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:52:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:52:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:52:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:52:49,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:52:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:49,218 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:52:49,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:52:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:52:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:52:49,218 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:49,219 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 08:52:49,219 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-07-25 08:52:49,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:49,486 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 08:52:49,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:49,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:52:49,487 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:52:49,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:52:49,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:52:49,488 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 08:52:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:49,506 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:52:49,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:52:49,506 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 08:52:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:49,507 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:52:49,507 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:52:49,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:52:49,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:52:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:52:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:52:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:52:49,514 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:52:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:49,514 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:52:49,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:52:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:52:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:52:49,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:49,515 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 08:52:49,515 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-07-25 08:52:49,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:49,788 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 08:52:49,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:49,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:52:49,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:52:49,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:52:49,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:52:49,790 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 08:52:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:49,812 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:52:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:52:49,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 08:52:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:49,813 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:52:49,813 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:52:49,814 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:52:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:52:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:52:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:52:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:52:49,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:52:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:49,819 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:52:49,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:52:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:52:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:52:49,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:49,820 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 08:52:49,820 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-07-25 08:52:49,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:50,114 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 08:52:50,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:50,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:52:50,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:52:50,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:52:50,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:52:50,116 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 08:52:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:50,145 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:52:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:52:50,145 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 08:52:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:50,146 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:52:50,146 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:52:50,147 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:52:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:52:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:52:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:52:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:52:50,151 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:52:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:50,152 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:52:50,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:52:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:52:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:52:50,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:50,153 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 08:52:50,153 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-07-25 08:52:50,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:50,499 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 08:52:50,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:50,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:52:50,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:52:50,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:52:50,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:52:50,501 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 08:52:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:50,540 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:52:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:52:50,540 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 08:52:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:50,540 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:52:50,541 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:52:50,542 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:52:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:52:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:52:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:52:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:52:50,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:52:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:50,546 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:52:50,546 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:52:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:52:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:52:50,547 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:50,547 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 08:52:50,547 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-07-25 08:52:50,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:50,911 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 08:52:50,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:50,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:52:50,912 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:52:50,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:52:50,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:52:50,913 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 08:52:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:50,945 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:52:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:52:50,945 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 08:52:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:50,946 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:52:50,946 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:52:50,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:52:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:52:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:52:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:52:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:52:50,953 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:52:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:50,954 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:52:50,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:52:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:52:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:52:50,955 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:50,955 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 08:52:50,955 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-07-25 08:52:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:51,365 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 08:52:51,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:51,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:52:51,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:52:51,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:52:51,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:52:51,367 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 08:52:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:51,398 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:52:51,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:52:51,398 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 08:52:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:51,398 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:52:51,399 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:52:51,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:52:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:52:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:52:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:52:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:52:51,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:52:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:51,404 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:52:51,405 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:52:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:52:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:52:51,405 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:51,405 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 08:52:51,405 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-07-25 08:52:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:51,728 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 08:52:51,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:51,729 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:52:51,729 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:52:51,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:52:51,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:52:51,730 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 08:52:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:51,755 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:52:51,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:52:51,755 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 08:52:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:51,756 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:52:51,756 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:52:51,756 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:52:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:52:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:52:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:52:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:52:51,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:52:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:51,766 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:52:51,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:52:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:52:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:52:51,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:51,768 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 08:52:51,768 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-07-25 08:52:51,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:52,102 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 08:52:52,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:52,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:52:52,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:52:52,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:52:52,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:52:52,104 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 08:52:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:52,135 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:52:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:52:52,136 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 08:52:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:52,136 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:52:52,136 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:52:52,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:52:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:52:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:52:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:52:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:52:52,142 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:52:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:52,142 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:52:52,142 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:52:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:52:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:52:52,143 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:52,143 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 08:52:52,143 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-07-25 08:52:52,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:52,499 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 08:52:52,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:52,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:52:52,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:52:52,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:52:52,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:52:52,501 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 08:52:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:52,534 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:52:52,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:52:52,534 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 08:52:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:52,535 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:52:52,535 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:52:52,536 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:52:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:52:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:52:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:52:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:52:52,541 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:52:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:52,541 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:52:52,541 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:52:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:52:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:52:52,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:52,542 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 08:52:52,542 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-07-25 08:52:52,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:52,895 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 08:52:52,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:52,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:52:52,896 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:52:52,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:52:52,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:52:52,898 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 08:52:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:52,929 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:52:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:52:52,929 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 08:52:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:52,930 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:52:52,930 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:52:52,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:52:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:52:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:52:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:52:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:52:52,944 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:52:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:52,944 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:52:52,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:52:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:52:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:52:52,947 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:52,947 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 08:52:52,947 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-07-25 08:52:52,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:53,336 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 08:52:53,336 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:53,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:52:53,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:52:53,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:52:53,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:52:53,341 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 08:52:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:53,367 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:52:53,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:52:53,367 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 08:52:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:53,368 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:52:53,368 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:52:53,369 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:52:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:52:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:52:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:52:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:52:53,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:52:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:53,376 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:52:53,376 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:52:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:52:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:52:53,377 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:53,377 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 08:52:53,377 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-07-25 08:52:53,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:53,788 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 08:52:53,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:53,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:52:53,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:52:53,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:52:53,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:52:53,790 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 08:52:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:53,816 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:52:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:52:53,817 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 08:52:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:53,818 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:52:53,818 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:52:53,819 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:52:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:52:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:52:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:52:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:52:53,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:52:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:53,824 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:52:53,825 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:52:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:52:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:52:53,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:53,825 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 08:52:53,826 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-07-25 08:52:53,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:54,284 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 08:52:54,284 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:54,284 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:52:54,285 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:52:54,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:52:54,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:52:54,286 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 08:52:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:54,307 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:52:54,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:52:54,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 08:52:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:54,308 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:52:54,308 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:52:54,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:52:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:52:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:52:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:52:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:52:54,319 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:52:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:54,319 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:52:54,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:52:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:52:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:52:54,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:54,322 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 08:52:54,322 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-07-25 08:52:54,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:54,715 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 08:52:54,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:54,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:52:54,716 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:52:54,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:52:54,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:52:54,717 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 08:52:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:54,745 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:52:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:52:54,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 08:52:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:54,745 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:52:54,746 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:52:54,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:52:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:52:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:52:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:52:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:52:54,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:52:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:54,752 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:52:54,753 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:52:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:52:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:52:54,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:54,753 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 08:52:54,753 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-07-25 08:52:54,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:55,147 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 08:52:55,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:55,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:52:55,148 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:52:55,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:52:55,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:52:55,150 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 08:52:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:55,176 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:52:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:52:55,177 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 08:52:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:55,177 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:52:55,177 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:52:55,178 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:52:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:52:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:52:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:52:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:52:55,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:52:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:55,182 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:52:55,183 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:52:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:52:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:52:55,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:55,183 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 08:52:55,183 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-07-25 08:52:55,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:55,588 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 08:52:55,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:55,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:52:55,589 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:52:55,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:52:55,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:52:55,590 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 08:52:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:55,627 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:52:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:52:55,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 08:52:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:55,628 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:52:55,628 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:52:55,629 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:52:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:52:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:52:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:52:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:52:55,633 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:52:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:55,633 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:52:55,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:52:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:52:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:52:55,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:55,634 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 08:52:55,634 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-07-25 08:52:55,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:56,068 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 08:52:56,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:56,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:52:56,069 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:52:56,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:52:56,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:52:56,070 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 08:52:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:56,106 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:52:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:52:56,106 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 08:52:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:56,106 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:52:56,107 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:52:56,108 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:52:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:52:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:52:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:52:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:52:56,112 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:52:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:56,112 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:52:56,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:52:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:52:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:52:56,113 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:56,113 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 08:52:56,113 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-07-25 08:52:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:56,567 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 08:52:56,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:56,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:52:56,568 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:52:56,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:52:56,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:52:56,569 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 08:52:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:56,599 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:52:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:52:56,599 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 08:52:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:56,600 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:52:56,600 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:52:56,601 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:52:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:52:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:52:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:52:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:52:56,607 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:52:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:56,607 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:52:56,607 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:52:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:52:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:52:56,608 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:56,608 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 08:52:56,608 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-07-25 08:52:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:57,157 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 08:52:57,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:57,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:52:57,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:52:57,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:52:57,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:52:57,159 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 08:52:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:57,201 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:52:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:52:57,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 08:52:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:57,201 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:52:57,202 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:52:57,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:52:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:52:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:52:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:52:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:52:57,207 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:52:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:57,207 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:52:57,207 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:52:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:52:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:52:57,208 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:57,208 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 08:52:57,208 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-07-25 08:52:57,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:57,631 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 08:52:57,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:57,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:52:57,632 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:52:57,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:52:57,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:52:57,633 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 08:52:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:57,665 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:52:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:52:57,666 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 08:52:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:57,666 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:52:57,666 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:52:57,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:52:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:52:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:52:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:52:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:52:57,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:52:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:57,674 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:52:57,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:52:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:52:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:52:57,675 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:57,675 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 08:52:57,675 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-07-25 08:52:57,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:58,127 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 08:52:58,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:58,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:52:58,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:52:58,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:52:58,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:52:58,130 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 08:52:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:58,158 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:52:58,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:52:58,159 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 08:52:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:58,159 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:52:58,159 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:52:58,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:52:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:52:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:52:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:52:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:52:58,165 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:52:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:58,166 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:52:58,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:52:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:52:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:52:58,166 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:58,166 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 08:52:58,167 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-07-25 08:52:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:58,621 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 08:52:58,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:58,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:52:58,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:52:58,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:52:58,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:52:58,624 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 08:52:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:58,666 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:52:58,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:52:58,667 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 08:52:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:58,667 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:52:58,667 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:52:58,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:52:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:52:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:52:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:52:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:52:58,674 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:52:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:58,674 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:52:58,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:52:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:52:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:52:58,675 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:58,675 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 08:52:58,675 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:58,676 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-07-25 08:52:58,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:59,167 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 08:52:59,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:59,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:52:59,167 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:52:59,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:52:59,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:52:59,169 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 08:52:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:59,207 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:52:59,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:52:59,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 08:52:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:59,208 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:52:59,208 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:52:59,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:52:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:52:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:52:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:52:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:52:59,215 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:52:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:59,215 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:52:59,215 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:52:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:52:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:52:59,216 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:59,216 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 08:52:59,216 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-07-25 08:52:59,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:59,772 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 08:52:59,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:59,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:52:59,773 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:52:59,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:52:59,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:52:59,774 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 08:52:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:59,805 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:52:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:52:59,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 08:52:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:59,806 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:52:59,806 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:52:59,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:52:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:52:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:52:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:52:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:52:59,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:52:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:59,812 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:52:59,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:52:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:52:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:52:59,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:59,813 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 08:52:59,813 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-07-25 08:52:59,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:00,279 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 08:53:00,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:00,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:53:00,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:53:00,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:53:00,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:53:00,281 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 08:53:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:00,312 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:53:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:53:00,312 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 08:53:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:00,313 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:53:00,313 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:53:00,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:53:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:53:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:53:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:53:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:53:00,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:53:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:00,318 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:53:00,318 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:53:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:53:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:53:00,319 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:00,319 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 08:53:00,319 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-07-25 08:53:00,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:00,818 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 08:53:00,818 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:00,818 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:53:00,818 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:53:00,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:53:00,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:53:00,820 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 08:53:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:00,853 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:53:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:53:00,853 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 08:53:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:00,854 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:53:00,854 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:53:00,854 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:53:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:53:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:53:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:53:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:53:00,859 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:53:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:00,860 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:53:00,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:53:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:53:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:53:00,860 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:00,860 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 08:53:00,861 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-07-25 08:53:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:01,402 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 08:53:01,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:01,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:53:01,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:53:01,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:53:01,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:53:01,404 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 08:53:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:01,448 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:53:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:53:01,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 08:53:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:01,449 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:53:01,449 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:53:01,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:53:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:53:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:53:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:53:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:53:01,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:53:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:01,455 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:53:01,455 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:53:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:53:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:53:01,456 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:01,456 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 08:53:01,456 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-07-25 08:53:01,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:02,036 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 08:53:02,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:02,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:53:02,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:53:02,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:53:02,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:53:02,038 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 08:53:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:02,086 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:53:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:53:02,086 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 08:53:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:02,087 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:53:02,087 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:53:02,088 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:53:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:53:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:53:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:53:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:53:02,094 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:53:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:02,094 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:53:02,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:53:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:53:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:53:02,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:02,095 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 08:53:02,095 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-07-25 08:53:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:02,778 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 08:53:02,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:02,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:53:02,779 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:53:02,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:53:02,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:53:02,781 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 08:53:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:02,835 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:53:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:53:02,835 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 08:53:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:02,836 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:53:02,836 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:53:02,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:53:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:53:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:53:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:53:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:53:02,841 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:53:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:02,841 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:53:02,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:53:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:53:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:53:02,842 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:02,842 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 08:53:02,842 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-07-25 08:53:02,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:03,392 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 08:53:03,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:03,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:53:03,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:53:03,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:53:03,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:53:03,395 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 08:53:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:03,428 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:53:03,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:53:03,428 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 08:53:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:03,429 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:53:03,429 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:53:03,430 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:53:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:53:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:53:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:53:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:53:03,435 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:53:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:03,435 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:53:03,435 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:53:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:53:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:53:03,436 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:03,436 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 08:53:03,436 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-07-25 08:53:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:04,009 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 08:53:04,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:04,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:53:04,010 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:53:04,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:53:04,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:53:04,012 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 08:53:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:04,059 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:53:04,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:53:04,059 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 08:53:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:04,060 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:53:04,060 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:53:04,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:53:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:53:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:53:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:53:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:53:04,066 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:53:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:04,066 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:53:04,066 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:53:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:53:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:53:04,067 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:04,067 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 08:53:04,067 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-07-25 08:53:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:04,645 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 08:53:04,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:04,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:53:04,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:53:04,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:53:04,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:53:04,647 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 08:53:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:04,695 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:53:04,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:53:04,695 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 08:53:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:04,696 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:53:04,696 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:53:04,696 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:53:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:53:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:53:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:53:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:53:04,701 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:53:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:04,702 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:53:04,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:53:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:53:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:53:04,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:04,702 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 08:53:04,703 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:04,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-07-25 08:53:04,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:05,348 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 08:53:05,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:05,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:53:05,349 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:53:05,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:53:05,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:53:05,350 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 08:53:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:05,403 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:53:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:53:05,403 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 08:53:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:05,404 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:53:05,405 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:53:05,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:53:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:53:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:53:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:53:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:53:05,411 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:53:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:05,411 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:53:05,412 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:53:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:53:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:53:05,412 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:05,412 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 08:53:05,413 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-07-25 08:53:05,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:05,990 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 08:53:05,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:05,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:53:05,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:53:05,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:53:05,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:53:05,992 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 08:53:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:06,039 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:53:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:53:06,040 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 08:53:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:06,040 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:53:06,040 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:53:06,041 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:53:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:53:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:53:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:53:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:53:06,048 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:53:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:06,049 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:53:06,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:53:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:53:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:53:06,050 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:06,050 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 08:53:06,050 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-07-25 08:53:06,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:06,639 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 08:53:06,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:06,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:53:06,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:53:06,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:53:06,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:53:06,642 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 08:53:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:06,699 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:53:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:53:06,699 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 08:53:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:06,700 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:53:06,700 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:53:06,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:53:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:53:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:53:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:53:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:53:06,706 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:53:06,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:06,706 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:53:06,706 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:53:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:53:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:53:06,707 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:06,707 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 08:53:06,707 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:06,707 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-07-25 08:53:06,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:07,351 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 08:53:07,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:07,352 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:53:07,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:53:07,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:53:07,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:53:07,354 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 08:53:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:07,413 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:53:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:53:07,414 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 08:53:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:07,414 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:53:07,415 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:53:07,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:53:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:53:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:53:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:53:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:53:07,420 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:53:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:07,420 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:53:07,420 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:53:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:53:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:53:07,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:07,421 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 08:53:07,421 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-07-25 08:53:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:08,072 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 08:53:08,072 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:08,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:53:08,073 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:53:08,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:53:08,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:53:08,075 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 08:53:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:08,130 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:53:08,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:53:08,131 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 08:53:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:08,131 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:53:08,131 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:53:08,132 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:53:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:53:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:53:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:53:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:53:08,138 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:53:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:08,139 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:53:08,139 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:53:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:53:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:53:08,140 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:08,140 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 08:53:08,140 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-07-25 08:53:08,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:08,808 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 08:53:08,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:08,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:53:08,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:53:08,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:53:08,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:53:08,810 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 08:53:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:08,868 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:53:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:53:08,868 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 08:53:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:08,869 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:53:08,869 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:53:08,870 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:53:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:53:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:53:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:53:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:53:08,875 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:53:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:08,876 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:53:08,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:53:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:53:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:53:08,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:08,877 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 08:53:08,877 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-07-25 08:53:08,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:09,444 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 08:53:09,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:09,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:53:09,445 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:53:09,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:53:09,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:53:09,446 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 08:53:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:09,509 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:53:09,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:53:09,509 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 08:53:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:09,510 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:53:09,510 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:53:09,511 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:53:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:53:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:53:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:53:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:53:09,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:53:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:09,517 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:53:09,517 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:53:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:53:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:53:09,518 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:09,518 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 08:53:09,518 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:09,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-07-25 08:53:09,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:10,217 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 08:53:10,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:10,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:53:10,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:53:10,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:53:10,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:53:10,219 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 08:53:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:10,265 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:53:10,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:53:10,266 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 08:53:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:10,266 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:53:10,267 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:53:10,267 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:53:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:53:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:53:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:53:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:53:10,273 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:53:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:10,273 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:53:10,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:53:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:53:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:53:10,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:10,274 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 08:53:10,274 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-07-25 08:53:10,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:10,958 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 08:53:10,958 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:10,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:53:10,959 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:53:10,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:53:10,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:53:10,960 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 08:53:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:11,017 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:53:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:53:11,017 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 08:53:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:11,018 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:53:11,018 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:53:11,018 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:53:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:53:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:53:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:53:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:53:11,023 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:53:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:11,024 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:53:11,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:53:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:53:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:53:11,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:11,025 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 08:53:11,025 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-07-25 08:53:11,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:11,757 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 08:53:11,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:11,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:53:11,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:53:11,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:53:11,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:53:11,759 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 08:53:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:11,806 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:53:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:53:11,807 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 08:53:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:11,808 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:53:11,808 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:53:11,809 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:53:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:53:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:53:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:53:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:53:11,819 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:53:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:11,819 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:53:11,820 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:53:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:53:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:53:11,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:11,820 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 08:53:11,821 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-07-25 08:53:11,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:12,536 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 08:53:12,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:12,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:53:12,537 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:53:12,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:53:12,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:53:12,538 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 08:53:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:12,598 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:53:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:53:12,598 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 08:53:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:12,599 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:53:12,599 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:53:12,600 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:53:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:53:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:53:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:53:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:53:12,605 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:53:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:12,605 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:53:12,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:53:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:53:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:53:12,606 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:12,606 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 08:53:12,607 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-07-25 08:53:12,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:13,241 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 08:53:13,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:13,241 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:53:13,241 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:53:13,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:53:13,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:53:13,242 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 08:53:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:13,291 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:53:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:53:13,292 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 08:53:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:13,292 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:53:13,292 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:53:13,293 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:53:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:53:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:53:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:53:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:53:13,298 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:53:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:13,298 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:53:13,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:53:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:53:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:53:13,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:13,299 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 08:53:13,299 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-07-25 08:53:13,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:13,948 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 08:53:13,949 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:13,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:53:13,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:53:13,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:53:13,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:53:13,950 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 08:53:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:14,010 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:53:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:53:14,010 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 08:53:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:14,011 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:53:14,011 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:53:14,012 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:53:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:53:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:53:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:53:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:53:14,019 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:53:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:14,019 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:53:14,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:53:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:53:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:53:14,020 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:14,020 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 08:53:14,025 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-07-25 08:53:14,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:14,730 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 08:53:14,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:14,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:53:14,730 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:53:14,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:53:14,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:53:14,731 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 08:53:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:14,771 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:53:14,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:53:14,771 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 08:53:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:14,772 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:53:14,772 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:53:14,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:53:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:53:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:53:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:53:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:53:14,778 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:53:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:14,778 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:53:14,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:53:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:53:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:53:14,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:14,779 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 08:53:14,779 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-07-25 08:53:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:15,368 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 08:53:15,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:15,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:53:15,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:53:15,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:53:15,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:53:15,369 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 08:53:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:15,423 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:53:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:53:15,423 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 08:53:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:15,424 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:53:15,424 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:53:15,424 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:53:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:53:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:53:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:53:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:53:15,430 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:53:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:15,430 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:53:15,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:53:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:53:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:53:15,431 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:15,431 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 08:53:15,431 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-07-25 08:53:15,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:16,137 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 08:53:16,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:16,138 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:53:16,138 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:53:16,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:53:16,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:53:16,139 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 08:53:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:16,196 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:53:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:53:16,197 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 08:53:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:16,197 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:53:16,197 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:53:16,198 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:53:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:53:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:53:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:53:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:53:16,203 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:53:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:16,203 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:53:16,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:53:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:53:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:53:16,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:16,203 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 08:53:16,204 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-07-25 08:53:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:16,905 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 08:53:16,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:16,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:53:16,906 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:53:16,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:53:16,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:53:16,907 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 08:53:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:16,993 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:53:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:53:16,993 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 08:53:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:16,994 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:53:16,994 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:53:16,995 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:53:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:53:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:53:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:53:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:53:17,000 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:53:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:17,000 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:53:17,000 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:53:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:53:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:53:17,001 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:17,001 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 08:53:17,001 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-07-25 08:53:17,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:17,623 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 08:53:17,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:17,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:53:17,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:53:17,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:53:17,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:53:17,625 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 08:53:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:17,687 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:53:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:53:17,688 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 08:53:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:17,688 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:53:17,689 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:53:17,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:53:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:53:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:53:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:53:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:53:17,694 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:53:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:17,694 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:53:17,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:53:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:53:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:53:17,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:17,695 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 08:53:17,695 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:17,695 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-07-25 08:53:17,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:18,570 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 08:53:18,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:18,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:53:18,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:53:18,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:53:18,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:53:18,571 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 08:53:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:18,630 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:53:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:53:18,630 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 08:53:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:18,631 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:53:18,631 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:53:18,631 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:53:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:53:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:53:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:53:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:53:18,636 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:53:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:18,636 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:53:18,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:53:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:53:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:53:18,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:18,637 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 08:53:18,637 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-07-25 08:53:18,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:19,322 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 08:53:19,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:19,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:53:19,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:53:19,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:53:19,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:53:19,324 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 08:53:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:19,386 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:53:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:53:19,386 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 08:53:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:19,387 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:53:19,387 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:53:19,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:53:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:53:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:53:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:53:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:53:19,393 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:53:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:19,393 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:53:19,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:53:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:53:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:53:19,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:19,394 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 08:53:19,394 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-07-25 08:53:19,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:20,301 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 08:53:20,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:20,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:53:20,301 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:53:20,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:53:20,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:53:20,302 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 08:53:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:20,362 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:53:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:53:20,362 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 08:53:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:20,363 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:53:20,363 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:53:20,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:53:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:53:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:53:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:53:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:53:20,372 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:53:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:20,372 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:53:20,372 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:53:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:53:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:53:20,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:20,373 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 08:53:20,373 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-07-25 08:53:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:21,057 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 08:53:21,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:21,058 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:53:21,058 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:53:21,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:53:21,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:53:21,059 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 08:53:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:21,125 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:53:21,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:53:21,126 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 08:53:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:21,126 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:53:21,126 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:53:21,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:53:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:53:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:53:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:53:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:53:21,132 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:53:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:21,132 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:53:21,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:53:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:53:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:53:21,133 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:21,133 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 08:53:21,134 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-07-25 08:53:21,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:22,148 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 08:53:22,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:22,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:53:22,148 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:53:22,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:53:22,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:53:22,149 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 08:53:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:22,191 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:53:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:53:22,191 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 08:53:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:22,192 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:53:22,192 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:53:22,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:53:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:53:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:53:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:53:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:53:22,197 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:53:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:22,197 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:53:22,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:53:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:53:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:53:22,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:22,198 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 08:53:22,198 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-07-25 08:53:22,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:23,033 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 08:53:23,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:23,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:53:23,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:53:23,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:53:23,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:53:23,035 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 08:53:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:23,078 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:53:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:53:23,078 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 08:53:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:23,079 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:53:23,079 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:53:23,079 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:53:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:53:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:53:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:53:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:53:23,084 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:53:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:23,084 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:53:23,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:53:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:53:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:53:23,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:23,085 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 08:53:23,085 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:23,085 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-07-25 08:53:23,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:23,825 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 08:53:23,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:23,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:53:23,826 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:53:23,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:53:23,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:53:23,827 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 08:53:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:23,902 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:53:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:53:23,903 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 08:53:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:23,903 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:53:23,903 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:53:23,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:53:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:53:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:53:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:53:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:53:23,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:53:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:23,908 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:53:23,908 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:53:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:53:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:53:23,908 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:23,909 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 08:53:23,909 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-07-25 08:53:23,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:24,666 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 08:53:24,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:24,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:53:24,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:53:24,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:53:24,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:53:24,668 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 08:53:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:24,762 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:53:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:53:24,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 08:53:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:24,763 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:53:24,763 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:53:24,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:53:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:53:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:53:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:53:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:53:24,767 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:53:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:24,768 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:53:24,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:53:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:53:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:53:24,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:24,769 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 08:53:24,769 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:24,769 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-07-25 08:53:24,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:25,596 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 08:53:25,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:25,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:53:25,596 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:53:25,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:53:25,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:53:25,598 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 08:53:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:25,648 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:53:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:53:25,648 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 08:53:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:25,649 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:53:25,649 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:53:25,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:53:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:53:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:53:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:53:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:53:25,655 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:53:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:25,655 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:53:25,655 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:53:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:53:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:53:25,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:25,656 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 08:53:25,656 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:25,657 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-07-25 08:53:25,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:26,642 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 08:53:26,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:26,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:53:26,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:53:26,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:53:26,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:53:26,644 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 08:53:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:26,718 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:53:26,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:53:26,718 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 08:53:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:26,720 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:53:26,721 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:53:26,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:53:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:53:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:53:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:53:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:53:26,727 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:53:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:26,727 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:53:26,727 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:53:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:53:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:53:26,728 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:26,728 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 08:53:26,728 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:26,728 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-07-25 08:53:26,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:27,506 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 08:53:27,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:27,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:53:27,506 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:53:27,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:53:27,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:53:27,508 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 08:53:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:27,590 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:53:27,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:53:27,590 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 08:53:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:27,591 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:53:27,591 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:53:27,591 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:53:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:53:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:53:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:53:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:53:27,596 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:53:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:27,596 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:53:27,597 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:53:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:53:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:53:27,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:27,597 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 08:53:27,598 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-07-25 08:53:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:28,423 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 08:53:28,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:28,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:53:28,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:53:28,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:53:28,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:53:28,426 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 08:53:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:28,485 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:53:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:53:28,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 08:53:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:28,486 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:53:28,486 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:53:28,487 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:53:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:53:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:53:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:53:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:53:28,492 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:53:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:28,492 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:53:28,493 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:53:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:53:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:53:28,493 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:28,493 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 08:53:28,494 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-07-25 08:53:28,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:29,400 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 08:53:29,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:29,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:53:29,401 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:53:29,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:53:29,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:53:29,402 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 08:53:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:29,530 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:53:29,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:53:29,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 08:53:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:29,531 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:53:29,531 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:53:29,532 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:53:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:53:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:53:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:53:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:53:29,538 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:53:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:29,538 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:53:29,538 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:53:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:53:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:53:29,539 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:29,539 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 08:53:29,539 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-07-25 08:53:29,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:30,757 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 08:53:30,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:30,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:53:30,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:53:30,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:53:30,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:53:30,759 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 08:53:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:30,831 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:53:30,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:53:30,831 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 08:53:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:30,832 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:53:30,832 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:53:30,833 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:53:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:53:30,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:53:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:53:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:53:30,839 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:53:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:30,839 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:53:30,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:53:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:53:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:53:30,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:30,840 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 08:53:30,841 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-07-25 08:53:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:32,030 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:32,030 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:53:32,030 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:53:32,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:53:32,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:53:32,031 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 08:53:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:32,111 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:53:32,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:53:32,111 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 08:53:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:32,112 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:53:32,112 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:53:32,113 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:53:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:53:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:53:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:53:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:53:32,124 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:53:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:32,124 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:53:32,124 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:53:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:53:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:53:32,125 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:32,125 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 08:53:32,125 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-07-25 08:53:32,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:32,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:32,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:53:32,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:53:32,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:53:32,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:53:32,969 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 08:53:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:33,039 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:53:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:53:33,040 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 08:53:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:33,040 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:53:33,041 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:53:33,041 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:53:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:53:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:53:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:53:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:53:33,048 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:53:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:33,048 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:53:33,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:53:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:53:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:53:33,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:33,052 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 08:53:33,052 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-07-25 08:53:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:34,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:34,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:53:34,100 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:53:34,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:53:34,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:53:34,101 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 08:53:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:34,199 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:53:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:53:34,200 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 08:53:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:34,201 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:53:34,201 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:53:34,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:53:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:53:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:53:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:53:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:53:34,207 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:53:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:34,208 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:53:34,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:53:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:53:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:53:34,208 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:34,209 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 08:53:34,209 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-07-25 08:53:34,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:35,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:35,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:53:35,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:53:35,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:53:35,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:53:35,175 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 08:53:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:35,268 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:53:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:53:35,269 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 08:53:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:35,269 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:53:35,269 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:53:35,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:53:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:53:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:53:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:53:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:53:35,275 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:53:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:35,275 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:53:35,276 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:53:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:53:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:53:35,276 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:35,276 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 08:53:35,277 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-07-25 08:53:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:36,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:36,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:53:36,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:53:36,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:53:36,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:53:36,293 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 08:53:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:36,344 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:53:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:53:36,344 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 08:53:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:36,345 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:53:36,345 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:53:36,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:53:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:53:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:53:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:53:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:53:36,352 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:53:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:36,352 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:53:36,352 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:53:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:53:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:53:36,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:36,353 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 08:53:36,353 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-07-25 08:53:36,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:37,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:37,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:53:37,383 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:53:37,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:53:37,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:53:37,384 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 08:53:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:37,460 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:53:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:53:37,460 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 08:53:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:37,460 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:53:37,461 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:53:37,461 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:53:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:53:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:53:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:53:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:53:37,466 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:53:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:37,466 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:53:37,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:53:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:53:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:53:37,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:37,467 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 08:53:37,467 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-07-25 08:53:37,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:38,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:38,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:53:38,446 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:53:38,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:53:38,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:53:38,447 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 08:53:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:38,569 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:53:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:53:38,569 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 08:53:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:38,570 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:53:38,570 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:53:38,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:53:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:53:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:53:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:53:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:53:38,575 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:53:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:38,575 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:53:38,575 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:53:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:53:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:53:38,576 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:38,576 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 08:53:38,576 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-07-25 08:53:38,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:39,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:39,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:53:39,610 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:53:39,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:53:39,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:53:39,611 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-25 08:53:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:39,731 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 08:53:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:53:39,731 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-25 08:53:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:39,732 INFO L225 Difference]: With dead ends: 100 [2018-07-25 08:53:39,732 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 08:53:39,732 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:53:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 08:53:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 08:53:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:53:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 08:53:39,738 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 08:53:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:39,738 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 08:53:39,739 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:53:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 08:53:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 08:53:39,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:39,739 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-25 08:53:39,740 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-07-25 08:53:39,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:41,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:41,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:53:41,255 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:53:41,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:53:41,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:53:41,256 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-25 08:53:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:41,349 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:53:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:53:41,350 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-25 08:53:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:41,350 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:53:41,351 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:53:41,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:53:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:53:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:53:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:53:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:53:41,357 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 08:53:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:41,358 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:53:41,358 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:53:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:53:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:53:41,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:41,359 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-25 08:53:41,359 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-07-25 08:53:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:42,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:42,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:53:42,419 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:53:42,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:53:42,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:53:42,421 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-25 08:53:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:42,483 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 08:53:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:53:42,483 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-25 08:53:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:42,484 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:53:42,484 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:53:42,484 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:53:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:53:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 08:53:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:53:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 08:53:42,489 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 08:53:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:42,490 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 08:53:42,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:53:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 08:53:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 08:53:42,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:42,490 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-25 08:53:42,491 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-07-25 08:53:42,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:43,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:43,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:53:43,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:53:43,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:53:43,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:53:43,561 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-25 08:53:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:43,657 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:53:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:53:43,657 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-25 08:53:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:43,658 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:53:43,658 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:53:43,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:53:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:53:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:53:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:53:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:53:43,665 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 08:53:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:43,665 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:53:43,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:53:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:53:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:53:43,666 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:43,666 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-25 08:53:43,667 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-07-25 08:53:43,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:44,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:44,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:53:44,817 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:53:44,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:53:44,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:53:44,818 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-25 08:53:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:44,907 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 08:53:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:53:44,907 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-25 08:53:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:44,908 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:53:44,908 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:53:44,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:53:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:53:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 08:53:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:53:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 08:53:44,915 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 08:53:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:44,915 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 08:53:44,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:53:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 08:53:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 08:53:44,916 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:44,916 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-25 08:53:44,917 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-07-25 08:53:44,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:46,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:46,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:53:46,013 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:53:46,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:53:46,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:53:46,014 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-25 08:53:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:46,094 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:53:46,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:53:46,094 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-25 08:53:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:46,095 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:53:46,095 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:53:46,095 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:53:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:53:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:53:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:53:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:53:46,102 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 08:53:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:46,102 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:53:46,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:53:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:53:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:53:46,103 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:46,103 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-25 08:53:46,103 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:46,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-07-25 08:53:46,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:47,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:47,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:53:47,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:53:47,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:53:47,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:53:47,279 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-25 08:53:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:47,361 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 08:53:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:53:47,361 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-25 08:53:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:47,362 INFO L225 Difference]: With dead ends: 106 [2018-07-25 08:53:47,362 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:53:47,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:53:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:53:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:53:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:53:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 08:53:47,368 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 08:53:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:47,368 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 08:53:47,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:53:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 08:53:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:53:47,369 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:47,369 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-25 08:53:47,369 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-07-25 08:53:47,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:48,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:48,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:53:48,639 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:53:48,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:53:48,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:53:48,641 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-25 08:53:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:48,739 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:53:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:53:48,740 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-25 08:53:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:48,740 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:53:48,740 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:53:48,741 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:53:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:53:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:53:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:53:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:53:48,749 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 08:53:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:48,749 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:53:48,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:53:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:53:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:53:48,750 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:48,751 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-25 08:53:48,751 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-07-25 08:53:48,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:50,146 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:50,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:53:50,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:53:50,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:53:50,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:53:50,148 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-07-25 08:53:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:50,254 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 08:53:50,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:53:50,254 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-07-25 08:53:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:50,255 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:53:50,255 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:53:50,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:53:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:53:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 08:53:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 08:53:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 08:53:50,262 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 08:53:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:50,262 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 08:53:50,262 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:53:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 08:53:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 08:53:50,263 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:50,263 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-07-25 08:53:50,263 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-07-25 08:53:50,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:51,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:51,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:53:51,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:53:51,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:53:51,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:53:51,372 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-07-25 08:53:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:51,491 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:53:51,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:53:51,491 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-07-25 08:53:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:51,491 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:53:51,492 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:53:51,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:53:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:53:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:53:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:53:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:53:51,500 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 08:53:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:51,500 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:53:51,500 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:53:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:53:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:53:51,501 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:51,501 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-07-25 08:53:51,501 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-07-25 08:53:51,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:52,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:52,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:53:52,981 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:53:52,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:53:52,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:53:52,983 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-07-25 08:53:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:53,119 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 08:53:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:53:53,119 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-07-25 08:53:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:53,120 INFO L225 Difference]: With dead ends: 110 [2018-07-25 08:53:53,120 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 08:53:53,121 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:53:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 08:53:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 08:53:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:53:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 08:53:53,127 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 08:53:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:53,127 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 08:53:53,128 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:53:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 08:53:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 08:53:53,128 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:53,128 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-07-25 08:53:53,129 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-07-25 08:53:53,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:54,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:54,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:53:54,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:53:54,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:53:54,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:53:54,330 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-07-25 08:53:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:54,417 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:53:54,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:53:54,417 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-07-25 08:53:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:54,418 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:53:54,418 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:53:54,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:53:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:53:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:53:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:53:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:53:54,423 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 08:53:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:54,423 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:53:54,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:53:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:53:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:53:54,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:54,424 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-07-25 08:53:54,424 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-07-25 08:53:54,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:55,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:55,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:53:55,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:53:55,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:53:55,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:53:55,698 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-07-25 08:53:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:55,776 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 08:53:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:53:55,776 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-07-25 08:53:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:55,776 INFO L225 Difference]: With dead ends: 112 [2018-07-25 08:53:55,777 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 08:53:55,777 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:53:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 08:53:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 08:53:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 08:53:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 08:53:55,783 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 08:53:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:55,784 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 08:53:55,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:53:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 08:53:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 08:53:55,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:55,785 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-07-25 08:53:55,785 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-07-25 08:53:55,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:57,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:57,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:53:57,214 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:53:57,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:53:57,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:53:57,216 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-07-25 08:53:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:57,380 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:53:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:53:57,380 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-07-25 08:53:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:57,381 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:53:57,381 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:53:57,382 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:53:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:53:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:53:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:53:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:53:57,390 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 08:53:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:57,390 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:53:57,391 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:53:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:53:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:53:57,391 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:57,392 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-07-25 08:53:57,392 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-07-25 08:53:57,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:58,798 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:58,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:53:58,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:53:58,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:53:58,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:53:58,801 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-07-25 08:53:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:58,989 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 08:53:58,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:53:58,990 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-07-25 08:53:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:58,990 INFO L225 Difference]: With dead ends: 114 [2018-07-25 08:53:58,990 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:53:58,991 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:53:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:53:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 08:53:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 08:53:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 08:53:58,998 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 08:53:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:58,998 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 08:53:58,998 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:53:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 08:53:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 08:53:58,999 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:58,999 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-07-25 08:53:58,999 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-07-25 08:53:58,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:00,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:00,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:54:00,344 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:54:00,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:54:00,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:54:00,345 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-07-25 08:54:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:00,472 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:54:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:54:00,473 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-07-25 08:54:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:00,473 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:54:00,473 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:54:00,474 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:54:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:54:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:54:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:54:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:54:00,481 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 08:54:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:00,482 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:54:00,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:54:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:54:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:54:00,482 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:00,483 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-07-25 08:54:00,483 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-07-25 08:54:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:01,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:01,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:54:01,925 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:54:01,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:54:01,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:54:01,927 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-07-25 08:54:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:02,149 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 08:54:02,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:54:02,150 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-07-25 08:54:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:02,150 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:54:02,150 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:54:02,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:54:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:54:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 08:54:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 08:54:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 08:54:02,157 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 08:54:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:02,158 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 08:54:02,158 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:54:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 08:54:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 08:54:02,158 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:02,159 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-07-25 08:54:02,159 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-07-25 08:54:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:03,462 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:03,462 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:54:03,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:54:03,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:54:03,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:54:03,464 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-07-25 08:54:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:03,548 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:54:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:54:03,548 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-07-25 08:54:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:03,548 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:54:03,548 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:54:03,549 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:54:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:54:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:54:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:54:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:54:03,556 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 08:54:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:03,556 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:54:03,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:54:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:54:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:54:03,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:03,557 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-07-25 08:54:03,557 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-07-25 08:54:03,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:04,971 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:04,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:54:04,971 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:54:04,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:54:04,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:54:04,973 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-07-25 08:54:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:05,167 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 08:54:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:54:05,167 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-07-25 08:54:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:05,167 INFO L225 Difference]: With dead ends: 118 [2018-07-25 08:54:05,167 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 08:54:05,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:54:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 08:54:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 08:54:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 08:54:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 08:54:05,173 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 08:54:05,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:05,173 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 08:54:05,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:54:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 08:54:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 08:54:05,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:05,174 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-07-25 08:54:05,174 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:05,174 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-07-25 08:54:05,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:06,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:06,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:54:06,703 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:54:06,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:54:06,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:54:06,704 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-07-25 08:54:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:06,839 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:54:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:54:06,839 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-07-25 08:54:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:06,840 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:54:06,840 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:54:06,840 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:54:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:54:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:54:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:54:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:54:06,846 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 08:54:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:06,846 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:54:06,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:54:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:54:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:54:06,847 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:06,847 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-07-25 08:54:06,847 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-07-25 08:54:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:08,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:08,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:54:08,229 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:54:08,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:54:08,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:54:08,231 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-07-25 08:54:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:08,368 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 08:54:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:54:08,368 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-07-25 08:54:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:08,369 INFO L225 Difference]: With dead ends: 120 [2018-07-25 08:54:08,369 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 08:54:08,370 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:54:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 08:54:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 08:54:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:54:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 08:54:08,375 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 08:54:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:08,375 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 08:54:08,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:54:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 08:54:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 08:54:08,375 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:08,375 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-07-25 08:54:08,376 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-07-25 08:54:08,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:09,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:09,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:54:09,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:54:09,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:54:09,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:54:09,849 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-07-25 08:54:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:10,017 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:54:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:54:10,017 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-07-25 08:54:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:10,018 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:54:10,018 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:54:10,019 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:54:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:54:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:54:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:54:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:54:10,024 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 08:54:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:10,024 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:54:10,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:54:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:54:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:54:10,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:10,025 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-07-25 08:54:10,025 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:10,025 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-07-25 08:54:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:11,566 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:11,566 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:54:11,566 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:54:11,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:54:11,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:54:11,568 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-07-25 08:54:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:11,787 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 08:54:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:54:11,788 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-07-25 08:54:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:11,788 INFO L225 Difference]: With dead ends: 122 [2018-07-25 08:54:11,788 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 08:54:11,789 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:54:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 08:54:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 08:54:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 08:54:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 08:54:11,794 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 08:54:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:11,794 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 08:54:11,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:54:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 08:54:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 08:54:11,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:11,795 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-07-25 08:54:11,795 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-07-25 08:54:11,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:13,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:13,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:54:13,264 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:54:13,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:54:13,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:54:13,266 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-07-25 08:54:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:13,412 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:54:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:54:13,412 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-07-25 08:54:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:13,413 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:54:13,413 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:54:13,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:54:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:54:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:54:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:54:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:54:13,418 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 08:54:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:13,418 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:54:13,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:54:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:54:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:54:13,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:13,419 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-07-25 08:54:13,419 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-07-25 08:54:13,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:14,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:14,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:54:14,997 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:54:14,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:54:14,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:54:14,999 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-07-25 08:54:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:15,216 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 08:54:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:54:15,217 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-07-25 08:54:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:15,217 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:54:15,217 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:54:15,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:54:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:54:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 08:54:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 08:54:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 08:54:15,223 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 08:54:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:15,223 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 08:54:15,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:54:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 08:54:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 08:54:15,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:15,224 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-07-25 08:54:15,224 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-07-25 08:54:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:16,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:16,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:54:16,801 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:54:16,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:54:16,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:54:16,803 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-07-25 08:54:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:16,987 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:54:16,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:54:16,987 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-07-25 08:54:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:16,988 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:54:16,988 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:54:16,989 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:54:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:54:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:54:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:54:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:54:16,994 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 08:54:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:16,994 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:54:16,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:54:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:54:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:54:16,994 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:16,994 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-07-25 08:54:16,995 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-07-25 08:54:16,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:18,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:18,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:54:18,618 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:54:18,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:54:18,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:54:18,619 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-07-25 08:54:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:18,724 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 08:54:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:54:18,725 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-07-25 08:54:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:18,725 INFO L225 Difference]: With dead ends: 126 [2018-07-25 08:54:18,725 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 08:54:18,726 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:54:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 08:54:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 08:54:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:54:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 08:54:18,730 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 08:54:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:18,730 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 08:54:18,730 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:54:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 08:54:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 08:54:18,731 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:18,731 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-07-25 08:54:18,731 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-07-25 08:54:18,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:20,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:20,315 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:54:20,315 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:54:20,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:54:20,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:54:20,317 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-07-25 08:54:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:20,486 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:54:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:54:20,487 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-07-25 08:54:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:20,487 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:54:20,487 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:54:20,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:54:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:54:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:54:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:54:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:54:20,493 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 08:54:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:20,493 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:54:20,493 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:54:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:54:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:54:20,493 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:20,494 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-07-25 08:54:20,494 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-07-25 08:54:20,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:22,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:22,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:54:22,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:54:22,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:54:22,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:54:22,039 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-07-25 08:54:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:22,136 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 08:54:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:54:22,136 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-07-25 08:54:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:22,137 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:54:22,137 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 08:54:22,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:54:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 08:54:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 08:54:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 08:54:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 08:54:22,141 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 08:54:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:22,142 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 08:54:22,142 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:54:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 08:54:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 08:54:22,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:22,142 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-07-25 08:54:22,142 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-07-25 08:54:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:23,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:23,741 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:54:23,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:54:23,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:54:23,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:54:23,743 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-07-25 08:54:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:23,985 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:54:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:54:23,985 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-07-25 08:54:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:23,985 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:54:23,985 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:54:23,986 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:54:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:54:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:54:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:54:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:54:23,990 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 08:54:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:23,990 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:54:23,990 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:54:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:54:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:54:23,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:23,991 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-07-25 08:54:23,991 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:23,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-07-25 08:54:23,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:25,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:25,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:54:25,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:54:25,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:54:25,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:54:25,449 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-07-25 08:54:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:25,574 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 08:54:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:54:25,574 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-07-25 08:54:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:25,574 INFO L225 Difference]: With dead ends: 130 [2018-07-25 08:54:25,574 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:54:25,575 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:54:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:54:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 08:54:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 08:54:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 08:54:25,579 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 08:54:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:25,579 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 08:54:25,579 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:54:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 08:54:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 08:54:25,580 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:25,580 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-07-25 08:54:25,580 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-07-25 08:54:25,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:27,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:27,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:54:27,321 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:54:27,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:54:27,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:54:27,323 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-07-25 08:54:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:27,571 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:54:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:54:27,571 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-07-25 08:54:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:27,571 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:54:27,571 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:54:27,573 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:54:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:54:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:54:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:54:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:54:27,579 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 08:54:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:27,580 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:54:27,580 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:54:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:54:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:54:27,580 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:27,580 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-07-25 08:54:27,580 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-07-25 08:54:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:29,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:29,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:54:29,266 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:54:29,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:54:29,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:54:29,268 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-07-25 08:54:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:29,382 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 08:54:29,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:54:29,382 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-07-25 08:54:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:29,383 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:54:29,383 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 08:54:29,384 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:54:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 08:54:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 08:54:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 08:54:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 08:54:29,389 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 08:54:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:29,389 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 08:54:29,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:54:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 08:54:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 08:54:29,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:29,390 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-07-25 08:54:29,390 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-07-25 08:54:29,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:31,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:31,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:54:31,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:54:31,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:54:31,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:54:31,143 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-07-25 08:54:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:31,354 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:54:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:54:31,354 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-07-25 08:54:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:31,354 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:54:31,354 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:54:31,355 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:54:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:54:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:54:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:54:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:54:31,359 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 08:54:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:31,360 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:54:31,360 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:54:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:54:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:54:31,360 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:31,360 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-07-25 08:54:31,361 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-07-25 08:54:31,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:33,286 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:33,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:54:33,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:54:33,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:54:33,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:54:33,289 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-07-25 08:54:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:33,417 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 08:54:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:54:33,417 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-07-25 08:54:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:33,418 INFO L225 Difference]: With dead ends: 134 [2018-07-25 08:54:33,418 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:54:33,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:54:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:54:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 08:54:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:54:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 08:54:33,425 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 08:54:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:33,425 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 08:54:33,425 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:54:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 08:54:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 08:54:33,426 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:33,426 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-07-25 08:54:33,426 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-07-25 08:54:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:35,237 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:35,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:54:35,238 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:54:35,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:54:35,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:54:35,240 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-07-25 08:54:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:35,474 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:54:35,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:54:35,474 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-07-25 08:54:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:35,475 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:54:35,475 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:54:35,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:54:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:54:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:54:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:54:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:54:35,482 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 08:54:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:35,482 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:54:35,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:54:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:54:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:54:35,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:35,483 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-07-25 08:54:35,483 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-07-25 08:54:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:37,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:37,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:54:37,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:54:37,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:54:37,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:54:37,266 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-07-25 08:54:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:37,506 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 08:54:37,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:54:37,506 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-07-25 08:54:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:37,506 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:54:37,506 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:54:37,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:54:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:54:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 08:54:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 08:54:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 08:54:37,511 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 08:54:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:37,511 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 08:54:37,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:54:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 08:54:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 08:54:37,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:37,512 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-07-25 08:54:37,512 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-07-25 08:54:37,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:39,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:39,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:54:39,312 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:54:39,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:54:39,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:54:39,314 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-07-25 08:54:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:39,516 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:54:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:54:39,516 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-07-25 08:54:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:39,517 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:54:39,517 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:54:39,518 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:54:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:54:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:54:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:54:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:54:39,523 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 08:54:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:39,523 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:54:39,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:54:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:54:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:54:39,523 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:39,523 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-07-25 08:54:39,524 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-07-25 08:54:39,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:41,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:41,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:54:41,523 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:54:41,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:54:41,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:54:41,524 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-07-25 08:54:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:41,796 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 08:54:41,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:54:41,796 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-07-25 08:54:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:41,797 INFO L225 Difference]: With dead ends: 138 [2018-07-25 08:54:41,797 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:54:41,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:54:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:54:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 08:54:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:54:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 08:54:41,805 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 08:54:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:41,805 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 08:54:41,805 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:54:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 08:54:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 08:54:41,806 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:41,806 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-07-25 08:54:41,806 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-07-25 08:54:41,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:43,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:43,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:54:43,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:54:43,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:54:43,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:54:43,725 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-07-25 08:54:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:43,979 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:54:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:54:43,979 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-07-25 08:54:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:43,980 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:54:43,980 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:54:43,981 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:54:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:54:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:54:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:54:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:54:43,988 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 08:54:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:43,988 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:54:43,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:54:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:54:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:54:43,989 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:43,989 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-07-25 08:54:43,990 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-07-25 08:54:43,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:45,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:45,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:54:45,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:54:45,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:54:45,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:54:45,990 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-07-25 08:54:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:46,186 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 08:54:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:54:46,186 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-07-25 08:54:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:46,187 INFO L225 Difference]: With dead ends: 140 [2018-07-25 08:54:46,187 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 08:54:46,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:54:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 08:54:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 08:54:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:54:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 08:54:46,195 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 08:54:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:46,195 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 08:54:46,195 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:54:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 08:54:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 08:54:46,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:46,196 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-07-25 08:54:46,196 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-07-25 08:54:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:48,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:48,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:54:48,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:54:48,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:54:48,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:54:48,192 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-07-25 08:54:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:48,468 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:54:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:54:48,468 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-07-25 08:54:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:48,468 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:54:48,468 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:54:48,469 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:54:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:54:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:54:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:54:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:54:48,474 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 08:54:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:48,474 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:54:48,474 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:54:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:54:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:54:48,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:48,474 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-07-25 08:54:48,475 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:48,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-07-25 08:54:48,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:50,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:50,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:54:50,616 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:54:50,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:54:50,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:54:50,618 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-07-25 08:54:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:50,986 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 08:54:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:54:50,986 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-07-25 08:54:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:50,986 INFO L225 Difference]: With dead ends: 142 [2018-07-25 08:54:50,986 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 08:54:50,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:54:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 08:54:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 08:54:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 08:54:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 08:54:50,992 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 08:54:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:50,992 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 08:54:50,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:54:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 08:54:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:54:50,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:50,993 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-07-25 08:54:50,993 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-07-25 08:54:50,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:53,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:53,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:54:53,020 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:54:53,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:54:53,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:54:53,023 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-07-25 08:54:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:53,177 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:54:53,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:54:53,177 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-07-25 08:54:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:53,178 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:54:53,178 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:54:53,179 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:54:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:54:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:54:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:54:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:54:53,184 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 08:54:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:53,184 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:54:53,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:54:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:54:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:54:53,185 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:53,185 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-07-25 08:54:53,185 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-07-25 08:54:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:55,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:55,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:54:55,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:54:55,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:54:55,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:54:55,372 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-07-25 08:54:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:55,670 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 08:54:55,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:54:55,670 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-07-25 08:54:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:55,670 INFO L225 Difference]: With dead ends: 144 [2018-07-25 08:54:55,670 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 08:54:55,671 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:54:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 08:54:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 08:54:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 08:54:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 08:54:55,676 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 08:54:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:55,676 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 08:54:55,676 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:54:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 08:54:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 08:54:55,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:55,676 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-07-25 08:54:55,676 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:55,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-07-25 08:54:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:57,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:57,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:54:57,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:54:57,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:54:57,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:54:57,735 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-07-25 08:54:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:58,060 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:54:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:54:58,060 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-07-25 08:54:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:58,060 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:54:58,060 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:54:58,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:54:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:54:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:54:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:54:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:54:58,067 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 08:54:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:58,067 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:54:58,067 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:54:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:54:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:54:58,068 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:58,068 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-07-25 08:54:58,068 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-07-25 08:54:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:00,230 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:00,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:55:00,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:55:00,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:55:00,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:55:00,233 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-07-25 08:55:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:00,656 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 08:55:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:55:00,656 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-07-25 08:55:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:00,657 INFO L225 Difference]: With dead ends: 146 [2018-07-25 08:55:00,657 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:55:00,658 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:55:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:55:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:55:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:55:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 08:55:00,665 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 08:55:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:00,665 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 08:55:00,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:55:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 08:55:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 08:55:00,666 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:00,666 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-07-25 08:55:00,667 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-07-25 08:55:00,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:02,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:02,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:55:02,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:55:02,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:55:02,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:55:02,848 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-07-25 08:55:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:03,201 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:55:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:55:03,201 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-07-25 08:55:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:03,202 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:55:03,202 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:55:03,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:55:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:55:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:55:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:55:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:55:03,208 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 08:55:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:03,208 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:55:03,209 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:55:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:55:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:55:03,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:03,209 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-07-25 08:55:03,210 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-07-25 08:55:03,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:05,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:05,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:55:05,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:55:05,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:55:05,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:55:05,438 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-07-25 08:55:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:05,611 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 08:55:05,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:55:05,611 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-07-25 08:55:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:05,612 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:55:05,612 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 08:55:05,612 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:55:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 08:55:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 08:55:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:55:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 08:55:05,617 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 08:55:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:05,617 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 08:55:05,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:55:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 08:55:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 08:55:05,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:05,618 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-07-25 08:55:05,618 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:05,618 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-07-25 08:55:05,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:07,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:07,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:55:07,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:55:07,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:55:07,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:55:07,638 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-07-25 08:55:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:07,804 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:55:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:55:07,805 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-07-25 08:55:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:07,805 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:55:07,805 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:55:07,806 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:55:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:55:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:55:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:55:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:55:07,811 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 08:55:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:07,811 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:55:07,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:55:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:55:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:55:07,811 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:07,811 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-07-25 08:55:07,812 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-07-25 08:55:07,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:09,969 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:09,969 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:55:09,969 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:55:09,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:55:09,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:55:09,972 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-07-25 08:55:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:10,333 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 08:55:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:55:10,334 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-07-25 08:55:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:10,334 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:55:10,334 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:55:10,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:55:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:55:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 08:55:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 08:55:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 08:55:10,341 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 08:55:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:10,341 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 08:55:10,341 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:55:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 08:55:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 08:55:10,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:10,341 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-07-25 08:55:10,342 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-07-25 08:55:10,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:12,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:12,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:55:12,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:55:12,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:55:12,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:55:12,771 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-07-25 08:55:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:13,170 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:55:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:55:13,170 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-07-25 08:55:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:13,171 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:55:13,171 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:55:13,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:55:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:55:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:55:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:55:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:55:13,177 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 08:55:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:13,177 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:55:13,177 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:55:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:55:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:55:13,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:13,178 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-07-25 08:55:13,178 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-07-25 08:55:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:15,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:15,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:55:15,438 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:55:15,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:55:15,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:55:15,440 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-07-25 08:55:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:15,882 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 08:55:15,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:55:15,882 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-07-25 08:55:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:15,882 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:55:15,882 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:55:15,884 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:55:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:55:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 08:55:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:55:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 08:55:15,890 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 08:55:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:15,890 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 08:55:15,891 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:55:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 08:55:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 08:55:15,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:15,891 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-07-25 08:55:15,892 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-07-25 08:55:15,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:18,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:18,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:55:18,304 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:55:18,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:55:18,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:55:18,306 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-07-25 08:55:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:18,678 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:55:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:55:18,678 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-07-25 08:55:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:18,679 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:55:18,679 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:55:18,680 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:55:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:55:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:55:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:55:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:55:18,688 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 08:55:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:18,688 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:55:18,688 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:55:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:55:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:55:18,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:18,689 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-07-25 08:55:18,689 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-07-25 08:55:18,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:21,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:21,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:55:21,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:55:21,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:55:21,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:55:21,049 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-07-25 08:55:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:21,534 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 08:55:21,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:55:21,534 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-07-25 08:55:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:21,535 INFO L225 Difference]: With dead ends: 154 [2018-07-25 08:55:21,535 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 08:55:21,536 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:55:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 08:55:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 08:55:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:55:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 08:55:21,541 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 08:55:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:21,542 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 08:55:21,542 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:55:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 08:55:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 08:55:21,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:21,542 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-07-25 08:55:21,543 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-07-25 08:55:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:23,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:23,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:55:23,976 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:55:23,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:55:23,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:55:23,979 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-07-25 08:55:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:24,484 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:55:24,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:55:24,484 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-07-25 08:55:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:24,485 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:55:24,485 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:55:24,486 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:55:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:55:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:55:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:55:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:55:24,492 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 08:55:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:24,492 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:55:24,492 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:55:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:55:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:55:24,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:24,492 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-07-25 08:55:24,493 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-07-25 08:55:24,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:27,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:27,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:55:27,134 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:55:27,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:55:27,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:55:27,136 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-07-25 08:55:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:27,638 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 08:55:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:55:27,638 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-07-25 08:55:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:27,638 INFO L225 Difference]: With dead ends: 156 [2018-07-25 08:55:27,638 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 08:55:27,639 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:55:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 08:55:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 08:55:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 08:55:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 08:55:27,644 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 08:55:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:27,644 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 08:55:27,644 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:55:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 08:55:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 08:55:27,645 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:27,645 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-07-25 08:55:27,645 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-07-25 08:55:27,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:30,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:30,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:55:30,168 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:55:30,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:55:30,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:55:30,171 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-07-25 08:55:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:30,667 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:55:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:55:30,667 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-07-25 08:55:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:30,668 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:55:30,668 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:55:30,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:55:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:55:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:55:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:55:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:55:30,673 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 08:55:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:30,673 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:55:30,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:55:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:55:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:55:30,674 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:30,674 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-07-25 08:55:30,674 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-07-25 08:55:30,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:33,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:33,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 08:55:33,154 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:55:33,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:55:33,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:55:33,156 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-07-25 08:55:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:33,593 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 08:55:33,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:55:33,593 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-07-25 08:55:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:33,594 INFO L225 Difference]: With dead ends: 158 [2018-07-25 08:55:33,594 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 08:55:33,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:55:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 08:55:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 08:55:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 08:55:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 08:55:33,599 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 08:55:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:33,600 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 08:55:33,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:55:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 08:55:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 08:55:33,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:33,600 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-07-25 08:55:33,600 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-07-25 08:55:33,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:36,196 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:36,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 08:55:36,197 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 08:55:36,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 08:55:36,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:55:36,198 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-07-25 08:55:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:36,637 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:55:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:55:36,637 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-07-25 08:55:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:36,637 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:55:36,637 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:55:36,638 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:55:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:55:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:55:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:55:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:55:36,645 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 08:55:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:36,646 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:55:36,646 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 08:55:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:55:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:55:36,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:36,646 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-07-25 08:55:36,647 INFO L415 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-07-25 08:55:36,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:39,130 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:39,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 08:55:39,130 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 08:55:39,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 08:55:39,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:55:39,133 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-07-25 08:55:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:39,691 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 08:55:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 08:55:39,691 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-07-25 08:55:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:39,691 INFO L225 Difference]: With dead ends: 160 [2018-07-25 08:55:39,691 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 08:55:39,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:55:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 08:55:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 08:55:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 08:55:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 08:55:39,698 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 08:55:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:39,698 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 08:55:39,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 08:55:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 08:55:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 08:55:39,699 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:39,699 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-07-25 08:55:39,699 INFO L415 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-07-25 08:55:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:42,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:42,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 08:55:42,382 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 08:55:42,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 08:55:42,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:55:42,385 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-07-25 08:55:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:42,866 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:55:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 08:55:42,866 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-07-25 08:55:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:42,867 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:55:42,867 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:55:42,868 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:55:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:55:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:55:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:55:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:55:42,874 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 08:55:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:42,874 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:55:42,874 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 08:55:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:55:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:55:42,874 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:42,874 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-07-25 08:55:42,875 INFO L415 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-07-25 08:55:42,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:45,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:45,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 08:55:45,696 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 08:55:45,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 08:55:45,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:55:45,698 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-07-25 08:55:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:45,975 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 08:55:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:55:45,975 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-07-25 08:55:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:45,976 INFO L225 Difference]: With dead ends: 162 [2018-07-25 08:55:45,976 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 08:55:45,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:55:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 08:55:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 08:55:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 08:55:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 08:55:45,982 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 08:55:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:45,982 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 08:55:45,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 08:55:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 08:55:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 08:55:45,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:45,983 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-07-25 08:55:45,983 INFO L415 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-07-25 08:55:45,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:48,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:48,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 08:55:48,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 08:55:48,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 08:55:48,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:55:48,759 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-07-25 08:55:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:48,975 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:55:48,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 08:55:48,975 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-07-25 08:55:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:48,975 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:55:48,975 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:55:48,977 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:55:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:55:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:55:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:55:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:55:48,982 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 08:55:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:48,982 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:55:48,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 08:55:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:55:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:55:48,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:48,983 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-07-25 08:55:48,983 INFO L415 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-07-25 08:55:48,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:51,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:51,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 08:55:51,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 08:55:51,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 08:55:51,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:55:51,773 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-07-25 08:55:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:52,181 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 08:55:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 08:55:52,181 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-07-25 08:55:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:52,182 INFO L225 Difference]: With dead ends: 164 [2018-07-25 08:55:52,182 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 08:55:52,183 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:55:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 08:55:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 08:55:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 08:55:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 08:55:52,188 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 08:55:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:52,189 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 08:55:52,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 08:55:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 08:55:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 08:55:52,189 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:52,189 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-07-25 08:55:52,189 INFO L415 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-07-25 08:55:52,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:55,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:55,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 08:55:55,110 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 08:55:55,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 08:55:55,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:55:55,112 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-07-25 08:55:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:55,650 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:55:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 08:55:55,650 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-07-25 08:55:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:55,651 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:55:55,651 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:55:55,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:55:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:55:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:55:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:55:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:55:55,656 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 08:55:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:55,657 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:55:55,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 08:55:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:55:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:55:55,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:55,657 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-07-25 08:55:55,657 INFO L415 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-07-25 08:55:55,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:55:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:55:58,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:55:58,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 08:55:58,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 08:55:58,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 08:55:58,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:55:58,481 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-07-25 08:55:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:55:59,044 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 08:55:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 08:55:59,045 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-07-25 08:55:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:55:59,045 INFO L225 Difference]: With dead ends: 166 [2018-07-25 08:55:59,045 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 08:55:59,046 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:55:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 08:55:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 08:55:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 08:55:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 08:55:59,054 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 08:55:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:55:59,054 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 08:55:59,054 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 08:55:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 08:55:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 08:55:59,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:55:59,055 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-07-25 08:55:59,055 INFO L415 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:55:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-07-25 08:55:59,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:55:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:01,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:01,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 08:56:01,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 08:56:01,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 08:56:01,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:56:01,848 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-07-25 08:56:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:02,319 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:56:02,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 08:56:02,319 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-07-25 08:56:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:02,320 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:56:02,320 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:56:02,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:56:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:56:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:56:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:56:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:56:02,326 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 08:56:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:02,326 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:56:02,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 08:56:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:56:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:56:02,327 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:02,327 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-07-25 08:56:02,327 INFO L415 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-07-25 08:56:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:05,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:05,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 08:56:05,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 08:56:05,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 08:56:05,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:56:05,117 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-07-25 08:56:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:05,332 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 08:56:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 08:56:05,333 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-07-25 08:56:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:05,333 INFO L225 Difference]: With dead ends: 168 [2018-07-25 08:56:05,333 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 08:56:05,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:56:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 08:56:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 08:56:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 08:56:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 08:56:05,343 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 08:56:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:05,344 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 08:56:05,344 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 08:56:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 08:56:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 08:56:05,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:05,345 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-07-25 08:56:05,345 INFO L415 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:05,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-07-25 08:56:05,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:08,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:08,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 08:56:08,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 08:56:08,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 08:56:08,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:56:08,502 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-07-25 08:56:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:08,986 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:56:08,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 08:56:08,987 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-07-25 08:56:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:08,987 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:56:08,987 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:56:08,988 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:56:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:56:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:56:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:56:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:56:08,993 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 08:56:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:08,993 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:56:08,993 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 08:56:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:56:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:56:08,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:08,993 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-07-25 08:56:08,994 INFO L415 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:08,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-07-25 08:56:08,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:11,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:11,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 08:56:11,933 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 08:56:11,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 08:56:11,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:56:11,936 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-07-25 08:56:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:12,541 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 08:56:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 08:56:12,541 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-07-25 08:56:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:12,542 INFO L225 Difference]: With dead ends: 170 [2018-07-25 08:56:12,542 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 08:56:12,543 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:56:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 08:56:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 08:56:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 08:56:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 08:56:12,548 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 08:56:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:12,548 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 08:56:12,548 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 08:56:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 08:56:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 08:56:12,549 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:12,549 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-07-25 08:56:12,549 INFO L415 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757472, now seen corresponding path program 164 times [2018-07-25 08:56:12,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:15,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:15,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 08:56:15,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 08:56:15,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 08:56:15,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:56:15,264 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-07-25 08:56:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:15,662 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:56:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 08:56:15,662 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-07-25 08:56:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:15,662 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:56:15,663 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:56:15,664 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:56:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:56:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:56:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:56:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:56:15,669 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 08:56:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:15,669 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:56:15,669 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 08:56:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:56:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:56:15,669 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:15,670 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-07-25 08:56:15,670 INFO L415 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779834, now seen corresponding path program 165 times [2018-07-25 08:56:15,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:18,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:18,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 08:56:18,466 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 08:56:18,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 08:56:18,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:56:18,468 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-07-25 08:56:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:18,776 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 08:56:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 08:56:18,776 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-07-25 08:56:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:18,777 INFO L225 Difference]: With dead ends: 172 [2018-07-25 08:56:18,777 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 08:56:18,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:56:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 08:56:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 08:56:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 08:56:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 08:56:18,783 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 08:56:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:18,783 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 08:56:18,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 08:56:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 08:56:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 08:56:18,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:18,784 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-07-25 08:56:18,784 INFO L415 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538464, now seen corresponding path program 166 times [2018-07-25 08:56:18,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:21,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:21,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 08:56:21,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 08:56:21,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 08:56:21,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:56:21,741 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-07-25 08:56:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:22,573 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:56:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 08:56:22,573 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-07-25 08:56:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:22,574 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:56:22,574 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:56:22,575 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:56:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:56:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:56:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:56:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:56:22,580 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 08:56:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:22,580 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:56:22,581 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 08:56:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:56:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:56:22,581 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:22,581 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-07-25 08:56:22,581 INFO L415 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911302, now seen corresponding path program 167 times [2018-07-25 08:56:22,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:25,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:25,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 08:56:25,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 08:56:25,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 08:56:25,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:56:25,717 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-07-25 08:56:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:26,239 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 08:56:26,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 08:56:26,240 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-07-25 08:56:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:26,240 INFO L225 Difference]: With dead ends: 174 [2018-07-25 08:56:26,240 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 08:56:26,241 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:56:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 08:56:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 08:56:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 08:56:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 08:56:26,246 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 08:56:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:26,247 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 08:56:26,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 08:56:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 08:56:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 08:56:26,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:26,247 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-07-25 08:56:26,247 INFO L415 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -68328352, now seen corresponding path program 168 times [2018-07-25 08:56:26,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:29,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:29,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 08:56:29,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 08:56:29,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 08:56:29,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:56:29,296 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-07-25 08:56:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:29,748 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:56:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 08:56:29,748 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-07-25 08:56:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:29,748 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:56:29,748 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:56:29,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:56:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:56:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:56:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:56:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:56:29,755 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 08:56:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:29,756 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:56:29,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 08:56:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:56:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:56:29,756 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:29,756 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-07-25 08:56:29,756 INFO L415 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182778, now seen corresponding path program 169 times [2018-07-25 08:56:29,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:32,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:32,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 08:56:32,953 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 08:56:32,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 08:56:32,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:56:32,956 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-07-25 08:56:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:33,736 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 08:56:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 08:56:33,736 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-07-25 08:56:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:33,737 INFO L225 Difference]: With dead ends: 176 [2018-07-25 08:56:33,737 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 08:56:33,738 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:56:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 08:56:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 08:56:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 08:56:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 08:56:33,744 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 08:56:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:33,744 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 08:56:33,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 08:56:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 08:56:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 08:56:33,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:33,745 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-07-25 08:56:33,745 INFO L415 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160544, now seen corresponding path program 170 times [2018-07-25 08:56:33,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:36,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:36,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 08:56:37,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 08:56:37,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 08:56:37,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:56:37,003 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-07-25 08:56:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:37,237 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:56:37,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 08:56:37,238 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-07-25 08:56:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:37,238 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:56:37,238 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:56:37,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:56:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:56:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:56:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:56:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:56:37,246 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 08:56:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:37,246 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:56:37,246 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 08:56:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:56:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:56:37,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:37,247 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-07-25 08:56:37,247 INFO L415 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash 240724934, now seen corresponding path program 171 times [2018-07-25 08:56:37,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:40,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:40,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 08:56:40,573 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 08:56:40,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 08:56:40,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:56:40,575 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-07-25 08:56:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:41,274 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 08:56:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 08:56:41,274 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-07-25 08:56:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:41,275 INFO L225 Difference]: With dead ends: 178 [2018-07-25 08:56:41,275 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 08:56:41,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:56:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 08:56:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 08:56:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 08:56:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 08:56:41,281 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 08:56:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:41,282 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 08:56:41,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 08:56:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 08:56:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 08:56:41,282 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:41,282 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-07-25 08:56:41,282 INFO L415 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465504, now seen corresponding path program 172 times [2018-07-25 08:56:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:44,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:44,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 08:56:44,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 08:56:44,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 08:56:44,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:56:44,293 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-07-25 08:56:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:44,673 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:56:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 08:56:44,674 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-07-25 08:56:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:44,674 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:56:44,674 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:56:44,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 08:56:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:56:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:56:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:56:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:56:44,680 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 08:56:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:44,680 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:56:44,681 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 08:56:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:56:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:56:44,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:44,681 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-07-25 08:56:44,681 INFO L415 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash -591696122, now seen corresponding path program 173 times [2018-07-25 08:56:44,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:48,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:48,012 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 08:56:48,012 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 08:56:48,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 08:56:48,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:56:48,015 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-07-25 08:56:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:48,819 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 08:56:48,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 08:56:48,819 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-07-25 08:56:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:48,819 INFO L225 Difference]: With dead ends: 180 [2018-07-25 08:56:48,820 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 08:56:48,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 08:56:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 08:56:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 08:56:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 08:56:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 08:56:48,826 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 08:56:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:48,826 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 08:56:48,826 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 08:56:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 08:56:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 08:56:48,827 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:48,827 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-07-25 08:56:48,827 INFO L415 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1162714464, now seen corresponding path program 174 times [2018-07-25 08:56:48,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:56:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:56:52,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:56:52,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 08:56:52,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 08:56:52,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 08:56:52,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:56:52,217 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-07-25 08:56:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:56:52,787 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:56:52,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 08:56:52,787 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-07-25 08:56:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:56:52,787 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:56:52,788 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:56:52,788 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 08:56:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:56:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:56:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:56:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:56:52,794 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 08:56:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:56:52,794 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:56:52,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 08:56:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:56:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:56:52,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:56:52,795 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-07-25 08:56:52,795 INFO L415 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:56:52,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1684413882, now seen corresponding path program 175 times [2018-07-25 08:56:52,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:56:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 08:56:54,449 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:56:54,455 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:56:54,455 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:56:54 BoogieIcfgContainer [2018-07-25 08:56:54,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:56:54,460 INFO L168 Benchmark]: Toolchain (without parser) took 250804.04 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -51.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-25 08:56:54,461 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 08:56:54,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.62 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 08:56:54,462 INFO L168 Benchmark]: Boogie Preprocessor took 23.74 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 08:56:54,462 INFO L168 Benchmark]: RCFGBuilder took 230.69 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 08:56:54,470 INFO L168 Benchmark]: TraceAbstraction took 250500.40 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -61.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-25 08:56:54,472 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.20 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 44.62 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 23.74 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 230.69 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 250500.40 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -61.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 175, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 116 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 250.4s OverallTime, 176 OverallIterations, 175 TraceHistogramMax, 28.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 527 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 35702 SolverSat, 283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15575 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 185.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 175 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 15.3s SatisfiabilityAnalysisTime, 198.7s InterpolantComputationTime, 15750 NumberOfCodeBlocks, 15750 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 15575 ConstructedInterpolants, 0 QuantifiedInterpolants, 18203148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 175 InterpolantComputations, 1 PerfectInterpolantSequences, 0/893200 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-WithArrays.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-56-54-490.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-WithArrays.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-56-54-490.csv Completed graceful shutdown