java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:33:27,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:33:28,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:33:28,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:33:28,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:33:28,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:33:28,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:33:28,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:33:28,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:33:28,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:33:28,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:33:28,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:33:28,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:33:28,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:33:28,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:33:28,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:33:28,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:33:28,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:33:28,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:33:28,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:33:28,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:33:28,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:33:28,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:33:28,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:33:28,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:33:28,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:33:28,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:33:28,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:33:28,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:33:28,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:33:28,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:33:28,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:33:28,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:33:28,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:33:28,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:33:28,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:33:28,073 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:33:28,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:33:28,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:33:28,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:33:28,102 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:33:28,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:33:28,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:33:28,102 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:33:28,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:33:28,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:33:28,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:33:28,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:33:28,178 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:33:28,178 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:33:28,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-07-23 15:33:28,179 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-07-23 15:33:28,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:33:28,265 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:33:28,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:33:28,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:33:28,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:33:28,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:33:28,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:33:28,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:33:28,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:33:28,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/1) ... [2018-07-23 15:33:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 15:33:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-07-23 15:33:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 15:33:28,549 INFO L258 CfgBuilder]: Using library mode [2018-07-23 15:33:28,550 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:33:28 BoogieIcfgContainer [2018-07-23 15:33:28,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:33:28,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:33:28,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:33:28,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:33:28,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:28" (1/2) ... [2018-07-23 15:33:28,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc2dcd4 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:33:28, skipping insertion in model container [2018-07-23 15:33:28,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:33:28" (2/2) ... [2018-07-23 15:33:28,559 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-07-23 15:33:28,569 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:33:28,578 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:33:28,626 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:33:28,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:33:28,628 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:33:28,628 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:33:28,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:33:28,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:33:28,628 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:33:28,629 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:33:28,629 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:33:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-07-23 15:33:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:33:28,654 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:28,655 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:33:28,655 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1494612, now seen corresponding path program 1 times [2018-07-23 15:33:28,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:28,785 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-23 15:33:28,788 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:33:28,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-23 15:33:28,794 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:33:28,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:33:28,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:33:28,816 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-07-23 15:33:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:28,871 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-07-23 15:33:28,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:33:28,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 15:33:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:28,900 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:33:28,901 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 15:33:28,905 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:33:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 15:33:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 15:33:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 15:33:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 15:33:28,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-07-23 15:33:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 15:33:28,950 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:33:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 15:33:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:33:28,951 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:28,951 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-07-23 15:33:28,952 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1576645895, now seen corresponding path program 1 times [2018-07-23 15:33:28,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,030 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-23 15:33:29,031 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,031 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-23 15:33:29,034 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:33:29,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:33:29,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:33:29,035 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2018-07-23 15:33:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,072 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 15:33:29,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:33:29,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-07-23 15:33:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,073 INFO L225 Difference]: With dead ends: 12 [2018-07-23 15:33:29,074 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:33:29,075 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:33:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:33:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:33:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:33:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:33:29,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-07-23 15:33:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,080 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:33:29,080 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:33:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:33:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:33:29,081 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,081 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2018-07-23 15:33:29,081 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 95841652, now seen corresponding path program 2 times [2018-07-23 15:33:29,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:33:29,142 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:33:29,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:33:29,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:33:29,143 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-07-23 15:33:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,169 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:33:29,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:33:29,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-23 15:33:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,170 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:33:29,170 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 15:33:29,171 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:33:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 15:33:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 15:33:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 15:33:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 15:33:29,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-07-23 15:33:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,177 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 15:33:29,177 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:33:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 15:33:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:33:29,178 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,178 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1] [2018-07-23 15:33:29,178 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash -934264345, now seen corresponding path program 3 times [2018-07-23 15:33:29,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:33:29,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:33:29,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:33:29,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:33:29,263 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-07-23 15:33:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,291 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 15:33:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:33:29,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-07-23 15:33:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,292 INFO L225 Difference]: With dead ends: 18 [2018-07-23 15:33:29,292 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 15:33:29,293 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:33:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 15:33:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 15:33:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:33:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:33:29,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-07-23 15:33:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,302 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:33:29,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:33:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:33:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:33:29,303 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,303 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2018-07-23 15:33:29,303 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1280691052, now seen corresponding path program 4 times [2018-07-23 15:33:29,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,420 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:33:29,421 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:33:29,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:33:29,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:33:29,422 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-07-23 15:33:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,458 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 15:33:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:33:29,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 15:33:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,460 INFO L225 Difference]: With dead ends: 21 [2018-07-23 15:33:29,460 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 15:33:29,462 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:33:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 15:33:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 15:33:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 15:33:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-23 15:33:29,477 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-07-23 15:33:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,478 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-23 15:33:29,478 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:33:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-23 15:33:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 15:33:29,481 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,481 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1] [2018-07-23 15:33:29,481 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash -872307001, now seen corresponding path program 5 times [2018-07-23 15:33:29,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,586 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-23 15:33:29,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:33:29,588 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:33:29,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:33:29,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:33:29,589 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-07-23 15:33:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,620 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-23 15:33:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:33:29,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-07-23 15:33:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,622 INFO L225 Difference]: With dead ends: 24 [2018-07-23 15:33:29,622 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 15:33:29,623 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:33:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 15:33:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 15:33:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 15:33:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 15:33:29,630 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-07-23 15:33:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,631 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 15:33:29,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:33:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 15:33:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:33:29,632 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,632 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1] [2018-07-23 15:33:29,632 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1949574068, now seen corresponding path program 6 times [2018-07-23 15:33:29,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:33:29,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:33:29,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:33:29,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:33:29,697 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-07-23 15:33:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,737 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:33:29,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:33:29,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-07-23 15:33:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,739 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:33:29,739 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 15:33:29,740 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:33:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 15:33:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 15:33:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 15:33:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-23 15:33:29,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-07-23 15:33:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,761 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-23 15:33:29,761 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:33:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-23 15:33:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:33:29,762 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,762 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1] [2018-07-23 15:33:29,765 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1081351257, now seen corresponding path program 7 times [2018-07-23 15:33:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:33:29,872 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:33:29,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:33:29,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:33:29,874 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-07-23 15:33:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,923 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-23 15:33:29,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:33:29,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-23 15:33:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,927 INFO L225 Difference]: With dead ends: 30 [2018-07-23 15:33:29,928 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 15:33:29,928 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:33:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 15:33:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 15:33:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:33:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:33:29,940 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-07-23 15:33:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:33:29,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:33:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:33:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:33:29,945 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,945 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1] [2018-07-23 15:33:29,945 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2014722772, now seen corresponding path program 8 times [2018-07-23 15:33:29,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,079 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,079 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:33:30,080 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:33:30,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:33:30,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:33:30,081 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2018-07-23 15:33:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,126 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 15:33:30,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:33:30,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-07-23 15:33:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,129 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:33:30,129 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 15:33:30,131 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:33:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 15:33:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 15:33:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 15:33:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-23 15:33:30,145 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-07-23 15:33:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,146 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-23 15:33:30,146 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:33:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-23 15:33:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 15:33:30,149 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,149 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1] [2018-07-23 15:33:30,150 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1561528185, now seen corresponding path program 9 times [2018-07-23 15:33:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,269 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,269 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:33:30,269 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:33:30,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:33:30,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:33:30,271 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 12 states. [2018-07-23 15:33:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,312 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-23 15:33:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:33:30,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-07-23 15:33:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,317 INFO L225 Difference]: With dead ends: 36 [2018-07-23 15:33:30,318 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 15:33:30,318 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:33:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 15:33:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 15:33:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 15:33:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 15:33:30,331 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-07-23 15:33:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,332 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 15:33:30,332 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:33:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 15:33:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 15:33:30,333 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,334 INFO L353 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1] [2018-07-23 15:33:30,335 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -695043596, now seen corresponding path program 10 times [2018-07-23 15:33:30,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:33:30,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:33:30,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:33:30,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:33:30,436 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-07-23 15:33:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,478 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:33:30,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:33:30,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-07-23 15:33:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,479 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:33:30,483 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 15:33:30,484 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:33:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 15:33:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 15:33:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 15:33:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-23 15:33:30,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-07-23 15:33:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,496 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-23 15:33:30,496 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:33:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-23 15:33:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 15:33:30,498 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,498 INFO L353 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1] [2018-07-23 15:33:30,500 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -6101657, now seen corresponding path program 11 times [2018-07-23 15:33:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:33:30,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:33:30,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:33:30,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:33:30,615 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-07-23 15:33:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,647 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-23 15:33:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:33:30,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-07-23 15:33:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,649 INFO L225 Difference]: With dead ends: 42 [2018-07-23 15:33:30,649 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 15:33:30,652 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:33:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 15:33:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 15:33:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:33:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:33:30,661 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-07-23 15:33:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,662 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:33:30,662 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:33:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:33:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:33:30,663 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,664 INFO L353 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1] [2018-07-23 15:33:30,664 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1385504492, now seen corresponding path program 12 times [2018-07-23 15:33:30,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,780 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:33:30,781 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:33:30,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:33:30,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:33:30,784 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-07-23 15:33:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,818 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 15:33:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:33:30,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-07-23 15:33:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,819 INFO L225 Difference]: With dead ends: 45 [2018-07-23 15:33:30,819 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 15:33:30,820 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:33:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 15:33:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 15:33:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 15:33:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-23 15:33:30,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-07-23 15:33:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,831 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-23 15:33:30,831 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:33:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-23 15:33:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 15:33:30,832 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,833 INFO L353 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1] [2018-07-23 15:33:30,833 INFO L414 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash -928273849, now seen corresponding path program 13 times [2018-07-23 15:33:30,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:33:30,943 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:33:30,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:33:30,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:33:30,944 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2018-07-23 15:33:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,975 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-23 15:33:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:33:30,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-07-23 15:33:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,977 INFO L225 Difference]: With dead ends: 48 [2018-07-23 15:33:30,977 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 15:33:30,978 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:33:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 15:33:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 15:33:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 15:33:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 15:33:30,985 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-07-23 15:33:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,985 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 15:33:30,985 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:33:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 15:33:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 15:33:30,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,986 INFO L353 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1] [2018-07-23 15:33:30,987 INFO L414 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1088516148, now seen corresponding path program 14 times [2018-07-23 15:33:30,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:33:31,096 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:33:31,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:33:31,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:33:31,097 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-07-23 15:33:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,135 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 15:33:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:33:31,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-07-23 15:33:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,137 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:33:31,137 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 15:33:31,137 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:33:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 15:33:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 15:33:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 15:33:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-23 15:33:31,146 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-07-23 15:33:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-23 15:33:31,147 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:33:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-23 15:33:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 15:33:31,148 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,148 INFO L353 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1] [2018-07-23 15:33:31,151 INFO L414 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash 981813031, now seen corresponding path program 15 times [2018-07-23 15:33:31,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:33:31,293 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:33:31,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:33:31,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:33:31,298 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-07-23 15:33:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,333 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 15:33:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:33:31,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-07-23 15:33:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,335 INFO L225 Difference]: With dead ends: 54 [2018-07-23 15:33:31,335 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 15:33:31,336 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:33:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 15:33:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 15:33:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:33:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:33:31,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-07-23 15:33:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,348 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:33:31,348 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:33:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:33:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:33:31,351 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,351 INFO L353 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1] [2018-07-23 15:33:31,351 INFO L414 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 465053524, now seen corresponding path program 16 times [2018-07-23 15:33:31,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:33:31,508 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:33:31,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:33:31,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:33:31,509 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2018-07-23 15:33:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,544 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 15:33:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:33:31,545 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-07-23 15:33:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,545 INFO L225 Difference]: With dead ends: 57 [2018-07-23 15:33:31,546 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 15:33:31,546 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:33:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 15:33:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 15:33:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 15:33:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-23 15:33:31,554 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-07-23 15:33:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,554 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-23 15:33:31,554 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:33:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-23 15:33:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 15:33:31,555 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,556 INFO L353 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1] [2018-07-23 15:33:31,556 INFO L414 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1154630649, now seen corresponding path program 17 times [2018-07-23 15:33:31,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,698 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:33:31,698 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:33:31,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:33:31,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:33:31,699 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 20 states. [2018-07-23 15:33:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,741 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-23 15:33:31,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:33:31,741 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-07-23 15:33:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,742 INFO L225 Difference]: With dead ends: 60 [2018-07-23 15:33:31,743 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 15:33:31,746 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:33:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 15:33:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 15:33:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 15:33:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 15:33:31,757 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-07-23 15:33:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,757 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 15:33:31,758 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:33:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 15:33:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 15:33:31,759 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,759 INFO L353 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1] [2018-07-23 15:33:31,759 INFO L414 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 791742068, now seen corresponding path program 18 times [2018-07-23 15:33:31,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:33:31,926 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:33:31,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:33:31,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:33:31,927 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 21 states. [2018-07-23 15:33:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,970 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 15:33:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:33:31,971 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-07-23 15:33:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,972 INFO L225 Difference]: With dead ends: 63 [2018-07-23 15:33:31,972 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 15:33:31,973 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:33:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 15:33:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 15:33:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 15:33:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-23 15:33:31,989 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-07-23 15:33:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,989 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-23 15:33:31,989 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:33:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-23 15:33:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 15:33:31,990 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,990 INFO L353 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1] [2018-07-23 15:33:31,991 INFO L414 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1172109081, now seen corresponding path program 19 times [2018-07-23 15:33:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:32,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:32,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:33:32,170 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:33:32,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:33:32,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:33:32,171 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 22 states. [2018-07-23 15:33:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:32,211 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 15:33:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:33:32,212 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-07-23 15:33:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:32,212 INFO L225 Difference]: With dead ends: 66 [2018-07-23 15:33:32,213 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 15:33:32,214 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:33:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 15:33:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 15:33:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:33:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:33:32,221 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-07-23 15:33:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:32,221 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:33:32,221 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:33:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:33:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:33:32,222 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:32,222 INFO L353 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1] [2018-07-23 15:33:32,222 INFO L414 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash -217182828, now seen corresponding path program 20 times [2018-07-23 15:33:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:32,394 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-23 15:33:32,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:32,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:33:32,395 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:33:32,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:33:32,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:33:32,396 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 23 states. [2018-07-23 15:33:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:32,442 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 15:33:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:33:32,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-07-23 15:33:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:32,443 INFO L225 Difference]: With dead ends: 69 [2018-07-23 15:33:32,443 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 15:33:32,444 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:33:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 15:33:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 15:33:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 15:33:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-23 15:33:32,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-07-23 15:33:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:32,458 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-23 15:33:32,458 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:33:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-23 15:33:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 15:33:32,459 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:32,459 INFO L353 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1] [2018-07-23 15:33:32,459 INFO L414 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1872548409, now seen corresponding path program 21 times [2018-07-23 15:33:32,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:32,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:32,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:33:32,643 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:33:32,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:33:32,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:33:32,645 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 24 states. [2018-07-23 15:33:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:32,748 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-23 15:33:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:33:32,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-07-23 15:33:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:32,749 INFO L225 Difference]: With dead ends: 72 [2018-07-23 15:33:32,750 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 15:33:32,754 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:33:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 15:33:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 15:33:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 15:33:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 15:33:32,762 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-07-23 15:33:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:32,764 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 15:33:32,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:33:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 15:33:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 15:33:32,765 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:32,765 INFO L353 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1] [2018-07-23 15:33:32,765 INFO L414 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:32,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2054079308, now seen corresponding path program 22 times [2018-07-23 15:33:32,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:32,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:32,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:33:32,936 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:33:32,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:33:32,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:33:32,937 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 25 states. [2018-07-23 15:33:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:32,990 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 15:33:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:33:32,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-07-23 15:33:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:32,991 INFO L225 Difference]: With dead ends: 75 [2018-07-23 15:33:32,991 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 15:33:32,992 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:33:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 15:33:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 15:33:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 15:33:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-23 15:33:32,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-07-23 15:33:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:32,997 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-23 15:33:32,998 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:33:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-23 15:33:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 15:33:32,998 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:32,998 INFO L353 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1] [2018-07-23 15:33:32,999 INFO L414 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1617701543, now seen corresponding path program 23 times [2018-07-23 15:33:32,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:33,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:33,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:33:33,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:33:33,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:33:33,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:33:33,174 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 26 states. [2018-07-23 15:33:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:33,230 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 15:33:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:33:33,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-07-23 15:33:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:33,232 INFO L225 Difference]: With dead ends: 78 [2018-07-23 15:33:33,232 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 15:33:33,232 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:33:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 15:33:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 15:33:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:33:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:33:33,238 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-07-23 15:33:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:33,238 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:33:33,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:33:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:33:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:33:33,239 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:33,239 INFO L353 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1] [2018-07-23 15:33:33,240 INFO L414 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash -881028140, now seen corresponding path program 24 times [2018-07-23 15:33:33,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:33,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:33,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:33:33,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:33:33,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:33:33,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:33:33,423 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 27 states. [2018-07-23 15:33:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:33,477 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 15:33:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:33:33,478 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-07-23 15:33:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:33,479 INFO L225 Difference]: With dead ends: 81 [2018-07-23 15:33:33,479 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 15:33:33,480 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:33:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 15:33:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 15:33:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 15:33:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-23 15:33:33,487 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-07-23 15:33:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:33,488 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-23 15:33:33,488 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:33:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-23 15:33:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 15:33:33,489 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:33,489 INFO L353 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1] [2018-07-23 15:33:33,489 INFO L414 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash -163840121, now seen corresponding path program 25 times [2018-07-23 15:33:33,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:33,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:33,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:33:33,694 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:33:33,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:33:33,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:33:33,695 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 28 states. [2018-07-23 15:33:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:33,737 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-23 15:33:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:33:33,738 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-07-23 15:33:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:33,739 INFO L225 Difference]: With dead ends: 84 [2018-07-23 15:33:33,739 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 15:33:33,740 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:33:33,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 15:33:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 15:33:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 15:33:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 15:33:33,745 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-07-23 15:33:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:33,745 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 15:33:33,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:33:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 15:33:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 15:33:33,746 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:33,746 INFO L353 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1] [2018-07-23 15:33:33,747 INFO L414 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1877863692, now seen corresponding path program 26 times [2018-07-23 15:33:33,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:33,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:33,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:33:33,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:33:33,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:33:33,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:33:33,958 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 29 states. [2018-07-23 15:33:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:34,006 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 15:33:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:33:34,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-07-23 15:33:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:34,007 INFO L225 Difference]: With dead ends: 87 [2018-07-23 15:33:34,007 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 15:33:34,008 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:33:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 15:33:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 15:33:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 15:33:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-23 15:33:34,013 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-07-23 15:33:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:34,014 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-23 15:33:34,014 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:33:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-23 15:33:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 15:33:34,014 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:34,015 INFO L353 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1] [2018-07-23 15:33:34,015 INFO L414 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1487885209, now seen corresponding path program 27 times [2018-07-23 15:33:34,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:34,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:34,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:33:34,233 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:33:34,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:33:34,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:33:34,234 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 30 states. [2018-07-23 15:33:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:34,279 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-23 15:33:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:33:34,279 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-07-23 15:33:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:34,280 INFO L225 Difference]: With dead ends: 90 [2018-07-23 15:33:34,280 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 15:33:34,281 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:33:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 15:33:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 15:33:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:33:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:33:34,286 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-07-23 15:33:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:34,287 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:33:34,287 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:33:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:33:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:33:34,288 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:34,288 INFO L353 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1] [2018-07-23 15:33:34,288 INFO L414 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1525433836, now seen corresponding path program 28 times [2018-07-23 15:33:34,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:34,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:34,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:33:34,527 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:33:34,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:33:34,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:33:34,528 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 31 states. [2018-07-23 15:33:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:34,573 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 15:33:34,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:33:34,573 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-07-23 15:33:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:34,574 INFO L225 Difference]: With dead ends: 93 [2018-07-23 15:33:34,574 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 15:33:34,575 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:33:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 15:33:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 15:33:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 15:33:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-23 15:33:34,587 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-07-23 15:33:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:34,587 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-23 15:33:34,587 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:33:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-23 15:33:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 15:33:34,588 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:34,589 INFO L353 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1] [2018-07-23 15:33:34,589 INFO L414 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:34,589 INFO L82 PathProgramCache]: Analyzing trace with hash 849883463, now seen corresponding path program 29 times [2018-07-23 15:33:34,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:34,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:34,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:33:34,833 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:33:34,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:33:34,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:33:34,834 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2018-07-23 15:33:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:34,874 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-23 15:33:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:33:34,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-07-23 15:33:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:34,875 INFO L225 Difference]: With dead ends: 96 [2018-07-23 15:33:34,875 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 15:33:34,876 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:33:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 15:33:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 15:33:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 15:33:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 15:33:34,882 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-07-23 15:33:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:34,882 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 15:33:34,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:33:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 15:33:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 15:33:34,883 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:34,883 INFO L353 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1] [2018-07-23 15:33:34,884 INFO L414 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash 46369076, now seen corresponding path program 30 times [2018-07-23 15:33:34,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:35,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:35,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:33:35,140 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:33:35,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:33:35,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:33:35,141 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 33 states. [2018-07-23 15:33:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:35,194 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 15:33:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:33:35,194 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-07-23 15:33:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:35,195 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:33:35,195 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 15:33:35,196 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:33:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 15:33:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 15:33:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 15:33:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-23 15:33:35,203 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-07-23 15:33:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:35,203 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-23 15:33:35,203 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:33:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-23 15:33:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 15:33:35,205 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:35,205 INFO L353 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1] [2018-07-23 15:33:35,205 INFO L414 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1597993433, now seen corresponding path program 31 times [2018-07-23 15:33:35,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:35,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:35,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:33:35,551 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:33:35,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:33:35,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:33:35,552 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2018-07-23 15:33:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:35,604 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-23 15:33:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:33:35,605 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-07-23 15:33:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:35,605 INFO L225 Difference]: With dead ends: 102 [2018-07-23 15:33:35,606 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 15:33:35,607 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 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-23 15:33:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 15:33:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 15:33:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:33:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:33:35,613 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-07-23 15:33:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:35,613 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:33:35,613 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:33:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:33:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:33:35,614 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:35,615 INFO L353 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1] [2018-07-23 15:33:35,615 INFO L414 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash -404520876, now seen corresponding path program 32 times [2018-07-23 15:33:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:35,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:35,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:33:35,893 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:33:35,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:33:35,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:33:35,894 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 35 states. [2018-07-23 15:33:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:35,943 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 15:33:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:33:35,944 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2018-07-23 15:33:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:35,945 INFO L225 Difference]: With dead ends: 105 [2018-07-23 15:33:35,945 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 15:33:35,946 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:33:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 15:33:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 15:33:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 15:33:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-23 15:33:35,952 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-07-23 15:33:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:35,953 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-23 15:33:35,953 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:33:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-23 15:33:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 15:33:35,954 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:35,954 INFO L353 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1] [2018-07-23 15:33:35,954 INFO L414 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 597148423, now seen corresponding path program 33 times [2018-07-23 15:33:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:36,196 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:36,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:33:36,196 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:33:36,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:33:36,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:33:36,198 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 36 states. [2018-07-23 15:33:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:36,246 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-23 15:33:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:33:36,246 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-07-23 15:33:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:36,247 INFO L225 Difference]: With dead ends: 108 [2018-07-23 15:33:36,247 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 15:33:36,248 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:33:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 15:33:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-23 15:33:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 15:33:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-23 15:33:36,254 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-07-23 15:33:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:36,254 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-23 15:33:36,254 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:33:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-23 15:33:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 15:33:36,255 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:36,255 INFO L353 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1] [2018-07-23 15:33:36,255 INFO L414 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash -105537676, now seen corresponding path program 34 times [2018-07-23 15:33:36,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:36,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:36,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:33:36,500 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:33:36,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:33:36,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:33:36,501 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 37 states. [2018-07-23 15:33:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:36,559 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 15:33:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:33:36,560 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2018-07-23 15:33:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:36,561 INFO L225 Difference]: With dead ends: 111 [2018-07-23 15:33:36,561 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 15:33:36,562 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:33:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 15:33:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-23 15:33:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-23 15:33:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-23 15:33:36,569 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-07-23 15:33:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:36,569 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-23 15:33:36,569 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:33:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-23 15:33:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-23 15:33:36,570 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:36,570 INFO L353 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1] [2018-07-23 15:33:36,571 INFO L414 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash -156512281, now seen corresponding path program 35 times [2018-07-23 15:33:36,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:36,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:36,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:33:36,830 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:33:36,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:33:36,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:33:36,831 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2018-07-23 15:33:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:36,880 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-23 15:33:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:33:36,880 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-07-23 15:33:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:36,881 INFO L225 Difference]: With dead ends: 114 [2018-07-23 15:33:36,881 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 15:33:36,882 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:33:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 15:33:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-23 15:33:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 15:33:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 15:33:36,888 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-07-23 15:33:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:36,889 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 15:33:36,889 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:33:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 15:33:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 15:33:36,890 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:36,890 INFO L353 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1] [2018-07-23 15:33:36,890 INFO L414 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1677452948, now seen corresponding path program 36 times [2018-07-23 15:33:36,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:37,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:37,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:33:37,163 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:33:37,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:33:37,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:33:37,166 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 39 states. [2018-07-23 15:33:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:37,223 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-23 15:33:37,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:33:37,224 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2018-07-23 15:33:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:37,225 INFO L225 Difference]: With dead ends: 117 [2018-07-23 15:33:37,225 INFO L226 Difference]: Without dead ends: 116 [2018-07-23 15:33:37,226 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:33:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-23 15:33:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-23 15:33:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-23 15:33:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-23 15:33:37,232 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-07-23 15:33:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-23 15:33:37,233 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:33:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-23 15:33:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-23 15:33:37,235 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:37,235 INFO L353 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1] [2018-07-23 15:33:37,236 INFO L414 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1056617671, now seen corresponding path program 37 times [2018-07-23 15:33:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:37,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:37,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:33:37,539 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:33:37,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:33:37,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:33:37,541 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 40 states. [2018-07-23 15:33:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:37,611 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-23 15:33:37,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:33:37,612 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-07-23 15:33:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:37,613 INFO L225 Difference]: With dead ends: 120 [2018-07-23 15:33:37,613 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 15:33:37,615 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:33:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 15:33:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-23 15:33:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 15:33:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-23 15:33:37,626 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-07-23 15:33:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:37,632 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-23 15:33:37,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:33:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-23 15:33:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 15:33:37,634 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:37,634 INFO L353 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1] [2018-07-23 15:33:37,634 INFO L414 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash -117942860, now seen corresponding path program 38 times [2018-07-23 15:33:37,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:38,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:38,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:33:38,003 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:33:38,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:33:38,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:33:38,005 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 41 states. [2018-07-23 15:33:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:38,080 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 15:33:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:33:38,081 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2018-07-23 15:33:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:38,082 INFO L225 Difference]: With dead ends: 123 [2018-07-23 15:33:38,082 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 15:33:38,085 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:33:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 15:33:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-23 15:33:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-23 15:33:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-23 15:33:38,098 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-07-23 15:33:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:38,099 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-23 15:33:38,099 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:33:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-23 15:33:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-23 15:33:38,101 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:38,101 INFO L353 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1] [2018-07-23 15:33:38,101 INFO L414 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -352161369, now seen corresponding path program 39 times [2018-07-23 15:33:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:38,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:38,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:33:38,471 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:33:38,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:33:38,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:33:38,473 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 42 states. [2018-07-23 15:33:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:38,531 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-23 15:33:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:33:38,531 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-07-23 15:33:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:38,532 INFO L225 Difference]: With dead ends: 126 [2018-07-23 15:33:38,532 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 15:33:38,533 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:33:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 15:33:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-23 15:33:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 15:33:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 15:33:38,540 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-07-23 15:33:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:38,540 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 15:33:38,540 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:33:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 15:33:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 15:33:38,541 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:38,541 INFO L353 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1] [2018-07-23 15:33:38,542 INFO L414 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1366093012, now seen corresponding path program 40 times [2018-07-23 15:33:38,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:38,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:38,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:33:38,839 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:33:38,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:33:38,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:33:38,841 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 43 states. [2018-07-23 15:33:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:38,904 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-23 15:33:38,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:33:38,904 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2018-07-23 15:33:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:38,905 INFO L225 Difference]: With dead ends: 129 [2018-07-23 15:33:38,905 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 15:33:38,907 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:33:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 15:33:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-23 15:33:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 15:33:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-23 15:33:38,918 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-07-23 15:33:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:38,919 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-23 15:33:38,919 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:33:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-23 15:33:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-23 15:33:38,920 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:38,920 INFO L353 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1] [2018-07-23 15:33:38,920 INFO L414 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1832843641, now seen corresponding path program 41 times [2018-07-23 15:33:38,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:39,228 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:39,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:33:39,229 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:33:39,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:33:39,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:33:39,231 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 44 states. [2018-07-23 15:33:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:39,286 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-23 15:33:39,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:33:39,287 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2018-07-23 15:33:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:39,288 INFO L225 Difference]: With dead ends: 132 [2018-07-23 15:33:39,288 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 15:33:39,289 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:33:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 15:33:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-23 15:33:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 15:33:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-23 15:33:39,297 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-07-23 15:33:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:39,297 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-23 15:33:39,298 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:33:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-23 15:33:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 15:33:39,299 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:39,299 INFO L353 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1] [2018-07-23 15:33:39,299 INFO L414 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash -325342220, now seen corresponding path program 42 times [2018-07-23 15:33:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:39,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:39,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:33:39,623 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:33:39,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:33:39,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:33:39,625 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 45 states. [2018-07-23 15:33:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:39,685 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 15:33:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:33:39,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2018-07-23 15:33:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:39,687 INFO L225 Difference]: With dead ends: 135 [2018-07-23 15:33:39,687 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 15:33:39,688 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:33:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 15:33:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-23 15:33:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-23 15:33:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-23 15:33:39,696 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-07-23 15:33:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:39,697 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-23 15:33:39,697 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:33:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-23 15:33:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-23 15:33:39,698 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:39,699 INFO L353 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1] [2018-07-23 15:33:39,699 INFO L414 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1471443815, now seen corresponding path program 43 times [2018-07-23 15:33:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 0 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:40,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:40,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:33:40,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:33:40,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:33:40,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:33:40,020 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 46 states. [2018-07-23 15:33:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:40,079 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-23 15:33:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:33:40,080 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2018-07-23 15:33:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:40,081 INFO L225 Difference]: With dead ends: 138 [2018-07-23 15:33:40,081 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 15:33:40,082 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:33:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 15:33:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-23 15:33:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:33:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 15:33:40,090 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-07-23 15:33:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 15:33:40,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:33:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 15:33:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 15:33:40,093 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:40,093 INFO L353 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1] [2018-07-23 15:33:40,093 INFO L414 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1346802452, now seen corresponding path program 44 times [2018-07-23 15:33:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:40,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:40,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:33:40,446 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:33:40,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:33:40,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:33:40,447 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 47 states. [2018-07-23 15:33:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:40,539 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-23 15:33:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:33:40,540 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2018-07-23 15:33:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:40,541 INFO L225 Difference]: With dead ends: 141 [2018-07-23 15:33:40,541 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 15:33:40,542 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:33:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 15:33:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-23 15:33:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-23 15:33:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-23 15:33:40,551 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-07-23 15:33:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:40,551 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-23 15:33:40,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:33:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-23 15:33:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-23 15:33:40,553 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:40,554 INFO L353 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1] [2018-07-23 15:33:40,554 INFO L414 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -992298937, now seen corresponding path program 45 times [2018-07-23 15:33:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:40,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:40,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:33:40,968 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:33:40,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:33:40,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:33:40,969 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 48 states. [2018-07-23 15:33:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:41,032 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-23 15:33:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:33:41,032 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-07-23 15:33:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:41,034 INFO L225 Difference]: With dead ends: 144 [2018-07-23 15:33:41,034 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 15:33:41,035 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:33:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 15:33:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-23 15:33:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 15:33:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-23 15:33:41,043 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-07-23 15:33:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-23 15:33:41,044 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:33:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-23 15:33:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 15:33:41,045 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:41,046 INFO L353 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1] [2018-07-23 15:33:41,046 INFO L414 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 682598964, now seen corresponding path program 46 times [2018-07-23 15:33:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:41,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:41,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:33:41,404 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:33:41,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:33:41,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:33:41,406 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 49 states. [2018-07-23 15:33:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:41,485 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 15:33:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:33:41,486 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2018-07-23 15:33:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:41,487 INFO L225 Difference]: With dead ends: 147 [2018-07-23 15:33:41,487 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 15:33:41,488 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:33:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 15:33:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-23 15:33:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-23 15:33:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-23 15:33:41,496 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-07-23 15:33:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:41,497 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-23 15:33:41,497 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:33:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-23 15:33:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-23 15:33:41,498 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:41,498 INFO L353 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1] [2018-07-23 15:33:41,498 INFO L414 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:41,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1364077273, now seen corresponding path program 47 times [2018-07-23 15:33:41,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:41,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:41,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:33:41,844 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:33:41,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:33:41,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:33:41,846 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 50 states. [2018-07-23 15:33:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:41,933 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-23 15:33:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:33:41,934 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 145 [2018-07-23 15:33:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:41,935 INFO L225 Difference]: With dead ends: 150 [2018-07-23 15:33:41,935 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 15:33:41,936 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:33:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 15:33:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-23 15:33:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 15:33:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 15:33:41,946 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-07-23 15:33:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 15:33:41,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:33:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 15:33:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 15:33:41,948 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:41,948 INFO L353 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1] [2018-07-23 15:33:41,948 INFO L414 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1754847572, now seen corresponding path program 48 times [2018-07-23 15:33:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:42,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:42,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:33:42,306 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:33:42,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:33:42,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:33:42,310 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 51 states. [2018-07-23 15:33:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:42,385 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-23 15:33:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:33:42,386 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 148 [2018-07-23 15:33:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:42,387 INFO L225 Difference]: With dead ends: 153 [2018-07-23 15:33:42,387 INFO L226 Difference]: Without dead ends: 152 [2018-07-23 15:33:42,388 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:33:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-23 15:33:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-23 15:33:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-23 15:33:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-23 15:33:42,396 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-07-23 15:33:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:42,397 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-23 15:33:42,397 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:33:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-23 15:33:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-23 15:33:42,399 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:42,399 INFO L353 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1] [2018-07-23 15:33:42,399 INFO L414 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash 322423303, now seen corresponding path program 49 times [2018-07-23 15:33:42,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:42,742 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:42,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:33:42,743 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:33:42,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:33:42,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:33:42,748 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 52 states. [2018-07-23 15:33:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:42,812 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-23 15:33:42,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:33:42,812 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 151 [2018-07-23 15:33:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:42,814 INFO L225 Difference]: With dead ends: 156 [2018-07-23 15:33:42,814 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 15:33:42,815 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:33:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 15:33:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 15:33:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 15:33:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-23 15:33:42,824 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-07-23 15:33:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:42,824 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-23 15:33:42,825 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:33:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-23 15:33:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 15:33:42,826 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:42,827 INFO L353 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1] [2018-07-23 15:33:42,827 INFO L414 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1766078580, now seen corresponding path program 50 times [2018-07-23 15:33:42,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:43,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:43,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:33:43,208 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:33:43,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:33:43,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:33:43,210 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 53 states. [2018-07-23 15:33:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:43,307 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 15:33:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:33:43,307 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 154 [2018-07-23 15:33:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:43,308 INFO L225 Difference]: With dead ends: 159 [2018-07-23 15:33:43,308 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 15:33:43,310 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:33:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 15:33:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-23 15:33:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-23 15:33:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-23 15:33:43,321 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-07-23 15:33:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:43,322 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-23 15:33:43,322 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:33:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-23 15:33:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-23 15:33:43,327 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:43,327 INFO L353 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1] [2018-07-23 15:33:43,327 INFO L414 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash -102066457, now seen corresponding path program 51 times [2018-07-23 15:33:43,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 0 proven. 3978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:43,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:43,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:33:43,739 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:33:43,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:33:43,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:33:43,740 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 54 states. [2018-07-23 15:33:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:43,822 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-23 15:33:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:33:43,822 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2018-07-23 15:33:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:43,824 INFO L225 Difference]: With dead ends: 162 [2018-07-23 15:33:43,824 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 15:33:43,824 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:33:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 15:33:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-23 15:33:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 15:33:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 15:33:43,833 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-07-23 15:33:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:43,834 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 15:33:43,834 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:33:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 15:33:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 15:33:43,835 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:43,836 INFO L353 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1] [2018-07-23 15:33:43,836 INFO L414 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash 175357844, now seen corresponding path program 52 times [2018-07-23 15:33:43,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 0 proven. 4134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:44,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:44,177 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:33:44,177 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:33:44,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:33:44,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:33:44,178 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 55 states. [2018-07-23 15:33:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:44,254 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-23 15:33:44,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:33:44,254 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 160 [2018-07-23 15:33:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:44,259 INFO L225 Difference]: With dead ends: 165 [2018-07-23 15:33:44,259 INFO L226 Difference]: Without dead ends: 164 [2018-07-23 15:33:44,260 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:33:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-23 15:33:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-23 15:33:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-23 15:33:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-23 15:33:44,268 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-07-23 15:33:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:44,269 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-23 15:33:44,269 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:33:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-23 15:33:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-23 15:33:44,270 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:44,271 INFO L353 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1] [2018-07-23 15:33:44,271 INFO L414 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1405631431, now seen corresponding path program 53 times [2018-07-23 15:33:44,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 0 proven. 4293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:44,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:44,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:33:44,626 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:33:44,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:33:44,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:33:44,627 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 56 states. [2018-07-23 15:33:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:44,717 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-23 15:33:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:33:44,717 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 163 [2018-07-23 15:33:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:44,719 INFO L225 Difference]: With dead ends: 168 [2018-07-23 15:33:44,719 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 15:33:44,720 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:33:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 15:33:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-23 15:33:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 15:33:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-23 15:33:44,729 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-07-23 15:33:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-23 15:33:44,730 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:33:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-23 15:33:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 15:33:44,731 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:44,732 INFO L353 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1] [2018-07-23 15:33:44,732 INFO L414 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash -764842316, now seen corresponding path program 54 times [2018-07-23 15:33:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:45,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:45,120 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:33:45,121 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:33:45,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:33:45,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:33:45,122 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 57 states. [2018-07-23 15:33:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:45,229 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 15:33:45,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:33:45,229 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 166 [2018-07-23 15:33:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:45,231 INFO L225 Difference]: With dead ends: 171 [2018-07-23 15:33:45,231 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 15:33:45,232 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:33:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 15:33:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-23 15:33:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-23 15:33:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-23 15:33:45,240 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-07-23 15:33:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:45,240 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-23 15:33:45,240 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:33:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-23 15:33:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-23 15:33:45,242 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:45,242 INFO L353 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1] [2018-07-23 15:33:45,242 INFO L414 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:45,243 INFO L82 PathProgramCache]: Analyzing trace with hash -615597913, now seen corresponding path program 55 times [2018-07-23 15:33:45,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 0 proven. 4620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:45,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:45,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:33:45,632 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:33:45,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:33:45,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:33:45,634 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 58 states. [2018-07-23 15:33:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:45,716 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-23 15:33:45,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:33:45,717 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 169 [2018-07-23 15:33:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:45,718 INFO L225 Difference]: With dead ends: 174 [2018-07-23 15:33:45,718 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 15:33:45,719 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:33:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 15:33:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-23 15:33:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:33:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 15:33:45,727 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-07-23 15:33:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 15:33:45,728 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:33:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 15:33:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 15:33:45,729 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:45,730 INFO L353 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1] [2018-07-23 15:33:45,730 INFO L414 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 233260500, now seen corresponding path program 56 times [2018-07-23 15:33:45,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 0 proven. 4788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:46,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:46,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:33:46,233 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:33:46,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:33:46,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:33:46,235 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 59 states. [2018-07-23 15:33:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:46,319 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-23 15:33:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:33:46,319 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 172 [2018-07-23 15:33:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:46,321 INFO L225 Difference]: With dead ends: 177 [2018-07-23 15:33:46,321 INFO L226 Difference]: Without dead ends: 176 [2018-07-23 15:33:46,322 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:33:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-23 15:33:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-23 15:33:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-23 15:33:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-23 15:33:46,356 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-07-23 15:33:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:46,356 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-23 15:33:46,356 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:33:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-23 15:33:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-23 15:33:46,358 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:46,358 INFO L353 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1] [2018-07-23 15:33:46,358 INFO L414 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:46,360 INFO L82 PathProgramCache]: Analyzing trace with hash -193196665, now seen corresponding path program 57 times [2018-07-23 15:33:46,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:46,853 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:46,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:33:46,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:33:46,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:33:46,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:33:46,855 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 60 states. [2018-07-23 15:33:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:46,929 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-23 15:33:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:33:46,929 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 175 [2018-07-23 15:33:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:46,930 INFO L225 Difference]: With dead ends: 180 [2018-07-23 15:33:46,931 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 15:33:46,931 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:33:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 15:33:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-23 15:33:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 15:33:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-23 15:33:46,938 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-07-23 15:33:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:46,939 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-23 15:33:46,939 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:33:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-23 15:33:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 15:33:46,944 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:46,944 INFO L353 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1] [2018-07-23 15:33:46,944 INFO L414 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash -265337612, now seen corresponding path program 58 times [2018-07-23 15:33:46,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 0 proven. 5133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:47,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:47,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:33:47,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:33:47,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:33:47,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:33:47,370 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 61 states. [2018-07-23 15:33:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:47,455 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 15:33:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:33:47,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 178 [2018-07-23 15:33:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:47,456 INFO L225 Difference]: With dead ends: 183 [2018-07-23 15:33:47,456 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 15:33:47,457 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:33:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 15:33:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-23 15:33:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-23 15:33:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-23 15:33:47,466 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-07-23 15:33:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:47,466 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-23 15:33:47,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:33:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-23 15:33:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-23 15:33:47,468 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:47,469 INFO L353 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1] [2018-07-23 15:33:47,469 INFO L414 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1932641689, now seen corresponding path program 59 times [2018-07-23 15:33:47,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 5310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:47,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:47,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:33:47,913 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:33:47,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:33:47,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:33:47,915 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 62 states. [2018-07-23 15:33:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:48,026 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-23 15:33:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:33:48,026 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 181 [2018-07-23 15:33:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:48,028 INFO L225 Difference]: With dead ends: 186 [2018-07-23 15:33:48,028 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 15:33:48,029 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:33:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 15:33:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 15:33:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:33:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 15:33:48,037 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-07-23 15:33:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:48,037 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 15:33:48,037 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:33:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 15:33:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 15:33:48,039 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:48,039 INFO L353 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1] [2018-07-23 15:33:48,039 INFO L414 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1291621356, now seen corresponding path program 60 times [2018-07-23 15:33:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 0 proven. 5490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:48,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:48,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:33:48,487 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:33:48,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:33:48,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:33:48,489 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 63 states. [2018-07-23 15:33:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:48,584 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-23 15:33:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:33:48,584 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 184 [2018-07-23 15:33:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:48,585 INFO L225 Difference]: With dead ends: 189 [2018-07-23 15:33:48,586 INFO L226 Difference]: Without dead ends: 188 [2018-07-23 15:33:48,586 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:33:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-23 15:33:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-23 15:33:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-23 15:33:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-23 15:33:48,595 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-07-23 15:33:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:48,595 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-23 15:33:48,595 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:33:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-23 15:33:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-23 15:33:48,597 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:48,598 INFO L353 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1] [2018-07-23 15:33:48,598 INFO L414 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash -79478969, now seen corresponding path program 61 times [2018-07-23 15:33:48,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 0 proven. 5673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:49,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:49,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:33:49,112 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:33:49,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:33:49,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:33:49,113 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 64 states. [2018-07-23 15:33:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:49,194 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-23 15:33:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:33:49,194 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 187 [2018-07-23 15:33:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:49,195 INFO L225 Difference]: With dead ends: 192 [2018-07-23 15:33:49,195 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 15:33:49,196 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:33:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 15:33:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-23 15:33:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 15:33:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-23 15:33:49,204 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-07-23 15:33:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:49,205 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-23 15:33:49,205 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:33:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-23 15:33:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 15:33:49,207 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:49,207 INFO L353 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1] [2018-07-23 15:33:49,207 INFO L414 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1230652620, now seen corresponding path program 62 times [2018-07-23 15:33:49,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 0 proven. 5859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:49,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:49,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:33:49,647 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:33:49,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:33:49,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:33:49,649 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 65 states. [2018-07-23 15:33:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:49,762 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 15:33:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:33:49,762 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 190 [2018-07-23 15:33:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:49,764 INFO L225 Difference]: With dead ends: 195 [2018-07-23 15:33:49,764 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 15:33:49,765 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:33:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 15:33:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-23 15:33:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 15:33:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-23 15:33:49,773 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-07-23 15:33:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:49,774 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-23 15:33:49,774 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:33:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-23 15:33:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-23 15:33:49,776 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:49,776 INFO L353 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1] [2018-07-23 15:33:49,776 INFO L414 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash -531031001, now seen corresponding path program 63 times [2018-07-23 15:33:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 0 proven. 6048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:50,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:50,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:33:50,260 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:33:50,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:33:50,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:33:50,261 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 66 states. [2018-07-23 15:33:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:50,342 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-23 15:33:50,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:33:50,342 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 193 [2018-07-23 15:33:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:50,343 INFO L225 Difference]: With dead ends: 198 [2018-07-23 15:33:50,344 INFO L226 Difference]: Without dead ends: 197 [2018-07-23 15:33:50,345 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:33:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-23 15:33:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-23 15:33:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 15:33:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 15:33:50,356 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-07-23 15:33:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:50,356 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 15:33:50,356 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:33:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 15:33:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 15:33:50,359 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:50,359 INFO L353 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1] [2018-07-23 15:33:50,359 INFO L414 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1579666860, now seen corresponding path program 64 times [2018-07-23 15:33:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 0 proven. 6240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:50,795 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:50,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:33:50,796 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:33:50,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:33:50,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:33:50,797 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 67 states. [2018-07-23 15:33:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:50,916 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-23 15:33:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:33:50,916 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 196 [2018-07-23 15:33:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:50,918 INFO L225 Difference]: With dead ends: 201 [2018-07-23 15:33:50,918 INFO L226 Difference]: Without dead ends: 200 [2018-07-23 15:33:50,919 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:33:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-23 15:33:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-23 15:33:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 15:33:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-23 15:33:50,926 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-07-23 15:33:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:50,926 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-23 15:33:50,926 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:33:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-23 15:33:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-23 15:33:50,928 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:50,929 INFO L353 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1] [2018-07-23 15:33:50,929 INFO L414 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash 101568775, now seen corresponding path program 65 times [2018-07-23 15:33:50,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 0 proven. 6435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:51,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:51,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:33:51,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:33:51,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:33:51,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:33:51,386 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 68 states. [2018-07-23 15:33:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:51,535 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-23 15:33:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:33:51,535 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 199 [2018-07-23 15:33:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:51,537 INFO L225 Difference]: With dead ends: 204 [2018-07-23 15:33:51,537 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 15:33:51,538 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:33:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 15:33:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-23 15:33:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:33:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-23 15:33:51,547 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-07-23 15:33:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:51,547 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-23 15:33:51,547 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:33:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-23 15:33:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 15:33:51,550 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:51,550 INFO L353 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1] [2018-07-23 15:33:51,551 INFO L414 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:51,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2116234892, now seen corresponding path program 66 times [2018-07-23 15:33:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 0 proven. 6633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:52,144 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:52,144 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:33:52,145 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:33:52,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:33:52,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:33:52,146 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 69 states. [2018-07-23 15:33:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:52,275 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 15:33:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:33:52,275 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 202 [2018-07-23 15:33:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:52,277 INFO L225 Difference]: With dead ends: 207 [2018-07-23 15:33:52,277 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 15:33:52,277 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:33:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 15:33:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-23 15:33:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-23 15:33:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-23 15:33:52,284 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-07-23 15:33:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-23 15:33:52,284 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:33:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-23 15:33:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-23 15:33:52,287 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:52,287 INFO L353 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1] [2018-07-23 15:33:52,287 INFO L414 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1071603175, now seen corresponding path program 67 times [2018-07-23 15:33:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 0 proven. 6834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:52,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:52,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:33:52,750 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:33:52,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:33:52,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:33:52,752 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 70 states. [2018-07-23 15:33:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:52,888 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-23 15:33:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:33:52,888 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 205 [2018-07-23 15:33:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:52,890 INFO L225 Difference]: With dead ends: 210 [2018-07-23 15:33:52,890 INFO L226 Difference]: Without dead ends: 209 [2018-07-23 15:33:52,890 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:33:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-23 15:33:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-23 15:33:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 15:33:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-23 15:33:52,897 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-07-23 15:33:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:52,897 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-23 15:33:52,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:33:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-23 15:33:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 15:33:52,900 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:52,900 INFO L353 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1] [2018-07-23 15:33:52,900 INFO L414 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:52,900 INFO L82 PathProgramCache]: Analyzing trace with hash -361391980, now seen corresponding path program 68 times [2018-07-23 15:33:52,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 0 proven. 7038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:53,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:53,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:33:53,440 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:33:53,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:33:53,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:33:53,442 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 71 states. [2018-07-23 15:33:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:53,592 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-23 15:33:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:33:53,592 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 208 [2018-07-23 15:33:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:53,593 INFO L225 Difference]: With dead ends: 213 [2018-07-23 15:33:53,594 INFO L226 Difference]: Without dead ends: 212 [2018-07-23 15:33:53,594 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:33:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-23 15:33:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-07-23 15:33:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-23 15:33:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-07-23 15:33:53,601 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-07-23 15:33:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:53,601 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-07-23 15:33:53,601 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:33:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-07-23 15:33:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-23 15:33:53,603 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:53,604 INFO L353 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1] [2018-07-23 15:33:53,604 INFO L414 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1254867655, now seen corresponding path program 69 times [2018-07-23 15:33:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 0 proven. 7245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:54,135 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:54,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:33:54,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:33:54,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:33:54,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:33:54,137 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 72 states. [2018-07-23 15:33:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:54,294 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-07-23 15:33:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:33:54,295 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 211 [2018-07-23 15:33:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:54,296 INFO L225 Difference]: With dead ends: 216 [2018-07-23 15:33:54,296 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 15:33:54,297 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:33:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 15:33:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-23 15:33:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-23 15:33:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-23 15:33:54,304 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-07-23 15:33:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:54,304 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-23 15:33:54,304 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:33:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-23 15:33:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-23 15:33:54,307 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:54,307 INFO L353 BasicCegarLoop]: trace histogram [71, 71, 70, 1, 1] [2018-07-23 15:33:54,307 INFO L414 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash 367298484, now seen corresponding path program 70 times [2018-07-23 15:33:54,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 0 proven. 7455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:54,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:54,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:33:54,903 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:33:54,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:33:54,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:33:54,904 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 73 states. [2018-07-23 15:33:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:54,985 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-23 15:33:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:33:54,985 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 214 [2018-07-23 15:33:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:54,987 INFO L225 Difference]: With dead ends: 219 [2018-07-23 15:33:54,987 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 15:33:54,987 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:33:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 15:33:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-07-23 15:33:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-23 15:33:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-07-23 15:33:54,993 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-07-23 15:33:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:54,994 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-07-23 15:33:54,994 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:33:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-07-23 15:33:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-23 15:33:54,995 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:54,995 INFO L353 BasicCegarLoop]: trace histogram [72, 72, 71, 1, 1] [2018-07-23 15:33:54,995 INFO L414 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1387200601, now seen corresponding path program 71 times [2018-07-23 15:33:54,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 0 proven. 7668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:55,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:55,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:33:55,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:33:55,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:33:55,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:33:55,397 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 74 states. [2018-07-23 15:33:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:55,552 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-07-23 15:33:55,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:33:55,553 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 217 [2018-07-23 15:33:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:55,554 INFO L225 Difference]: With dead ends: 222 [2018-07-23 15:33:55,554 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 15:33:55,555 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:33:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 15:33:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-23 15:33:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 15:33:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-23 15:33:55,562 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-07-23 15:33:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:55,562 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-23 15:33:55,562 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:33:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-23 15:33:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 15:33:55,564 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:55,564 INFO L353 BasicCegarLoop]: trace histogram [73, 73, 72, 1, 1] [2018-07-23 15:33:55,564 INFO L414 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash 82550484, now seen corresponding path program 72 times [2018-07-23 15:33:55,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 0 proven. 7884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:56,009 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:56,009 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:33:56,010 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:33:56,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:33:56,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:33:56,011 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 75 states. [2018-07-23 15:33:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:56,093 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-23 15:33:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:33:56,093 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 220 [2018-07-23 15:33:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:56,095 INFO L225 Difference]: With dead ends: 225 [2018-07-23 15:33:56,095 INFO L226 Difference]: Without dead ends: 224 [2018-07-23 15:33:56,096 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:33:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-23 15:33:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-07-23 15:33:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-23 15:33:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-07-23 15:33:56,102 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-07-23 15:33:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:56,103 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-07-23 15:33:56,103 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:33:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-07-23 15:33:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-23 15:33:56,104 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:56,104 INFO L353 BasicCegarLoop]: trace histogram [74, 74, 73, 1, 1] [2018-07-23 15:33:56,105 INFO L414 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1754459001, now seen corresponding path program 73 times [2018-07-23 15:33:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8103 backedges. 0 proven. 8103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:56,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:56,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:33:56,615 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:33:56,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:33:56,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:33:56,617 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 76 states. [2018-07-23 15:33:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:56,788 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-07-23 15:33:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:33:56,788 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 223 [2018-07-23 15:33:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:56,790 INFO L225 Difference]: With dead ends: 228 [2018-07-23 15:33:56,790 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 15:33:56,791 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:33:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 15:33:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-23 15:33:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-23 15:33:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-23 15:33:56,806 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-07-23 15:33:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:56,806 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-23 15:33:56,806 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:33:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-23 15:33:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-23 15:33:56,808 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:56,808 INFO L353 BasicCegarLoop]: trace histogram [75, 75, 74, 1, 1] [2018-07-23 15:33:56,808 INFO L414 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1630741004, now seen corresponding path program 74 times [2018-07-23 15:33:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 0 proven. 8325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:57,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:57,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:33:57,247 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:33:57,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:33:57,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:33:57,248 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 77 states. [2018-07-23 15:33:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:57,354 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-23 15:33:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:33:57,354 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 226 [2018-07-23 15:33:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:57,356 INFO L225 Difference]: With dead ends: 231 [2018-07-23 15:33:57,356 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 15:33:57,357 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:33:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 15:33:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-07-23 15:33:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-23 15:33:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-07-23 15:33:57,366 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-07-23 15:33:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:57,366 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-07-23 15:33:57,367 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:33:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-07-23 15:33:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-23 15:33:57,368 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:57,368 INFO L353 BasicCegarLoop]: trace histogram [76, 76, 75, 1, 1] [2018-07-23 15:33:57,369 INFO L414 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:57,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1029832345, now seen corresponding path program 75 times [2018-07-23 15:33:57,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8550 backedges. 0 proven. 8550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:57,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:57,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:33:57,825 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:33:57,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:33:57,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:33:57,826 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 78 states. [2018-07-23 15:33:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:57,901 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-07-23 15:33:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:33:57,901 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 229 [2018-07-23 15:33:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:57,902 INFO L225 Difference]: With dead ends: 234 [2018-07-23 15:33:57,902 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 15:33:57,903 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:33:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 15:33:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-23 15:33:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 15:33:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-23 15:33:57,910 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-07-23 15:33:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:57,910 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-23 15:33:57,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:33:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-23 15:33:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 15:33:57,911 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:57,912 INFO L353 BasicCegarLoop]: trace histogram [77, 77, 76, 1, 1] [2018-07-23 15:33:57,912 INFO L414 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash -783661804, now seen corresponding path program 76 times [2018-07-23 15:33:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:58,297 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-23 15:33:58,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:58,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:33:58,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:33:58,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:33:58,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:33:58,299 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 79 states. [2018-07-23 15:33:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:58,383 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-23 15:33:58,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:33:58,383 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 232 [2018-07-23 15:33:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:58,384 INFO L225 Difference]: With dead ends: 237 [2018-07-23 15:33:58,384 INFO L226 Difference]: Without dead ends: 236 [2018-07-23 15:33:58,384 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:33:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-23 15:33:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-07-23 15:33:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 15:33:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-07-23 15:33:58,390 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-07-23 15:33:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:58,391 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-07-23 15:33:58,391 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:33:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-07-23 15:33:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-23 15:33:58,391 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:58,392 INFO L353 BasicCegarLoop]: trace histogram [78, 78, 77, 1, 1] [2018-07-23 15:33:58,392 INFO L414 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:58,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1373750855, now seen corresponding path program 77 times [2018-07-23 15:33:58,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9009 backedges. 0 proven. 9009 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:58,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:58,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:33:58,793 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:33:58,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:33:58,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:33:58,794 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 80 states. [2018-07-23 15:33:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:58,869 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-07-23 15:33:58,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:33:58,869 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 235 [2018-07-23 15:33:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:58,870 INFO L225 Difference]: With dead ends: 240 [2018-07-23 15:33:58,871 INFO L226 Difference]: Without dead ends: 239 [2018-07-23 15:33:58,871 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:33:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-23 15:33:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-23 15:33:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-23 15:33:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-23 15:33:58,876 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-07-23 15:33:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:58,877 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-23 15:33:58,877 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:33:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-23 15:33:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-23 15:33:58,877 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:58,878 INFO L353 BasicCegarLoop]: trace histogram [79, 79, 78, 1, 1] [2018-07-23 15:33:58,878 INFO L414 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1331309516, now seen corresponding path program 78 times [2018-07-23 15:33:58,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 0 proven. 9243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:59,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:59,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:33:59,305 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:33:59,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:33:59,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:33:59,306 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 81 states. [2018-07-23 15:33:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:59,378 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-23 15:33:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:33:59,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 238 [2018-07-23 15:33:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:59,379 INFO L225 Difference]: With dead ends: 243 [2018-07-23 15:33:59,379 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 15:33:59,380 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:33:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 15:33:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-07-23 15:33:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-23 15:33:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-07-23 15:33:59,387 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-07-23 15:33:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:59,387 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-07-23 15:33:59,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:33:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-07-23 15:33:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-07-23 15:33:59,389 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:59,389 INFO L353 BasicCegarLoop]: trace histogram [80, 80, 79, 1, 1] [2018-07-23 15:33:59,389 INFO L414 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1313447129, now seen corresponding path program 79 times [2018-07-23 15:33:59,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 0 proven. 9480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:59,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:59,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:33:59,826 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:33:59,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:33:59,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:33:59,827 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 82 states. [2018-07-23 15:33:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:59,958 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-07-23 15:33:59,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:33:59,958 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 241 [2018-07-23 15:33:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:59,959 INFO L225 Difference]: With dead ends: 246 [2018-07-23 15:33:59,959 INFO L226 Difference]: Without dead ends: 245 [2018-07-23 15:33:59,960 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:33:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-23 15:33:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-23 15:33:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:33:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-23 15:33:59,967 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-07-23 15:33:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-23 15:33:59,967 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:33:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-23 15:33:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 15:33:59,968 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:59,969 INFO L353 BasicCegarLoop]: trace histogram [81, 81, 80, 1, 1] [2018-07-23 15:33:59,969 INFO L414 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:33:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1751020716, now seen corresponding path program 80 times [2018-07-23 15:33:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:00,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:00,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:34:00,405 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:34:00,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:34:00,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:34:00,407 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 83 states. [2018-07-23 15:34:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:00,575 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-23 15:34:00,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:34:00,576 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 244 [2018-07-23 15:34:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:00,577 INFO L225 Difference]: With dead ends: 249 [2018-07-23 15:34:00,577 INFO L226 Difference]: Without dead ends: 248 [2018-07-23 15:34:00,578 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:34:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-07-23 15:34:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-07-23 15:34:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-07-23 15:34:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-07-23 15:34:00,585 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-07-23 15:34:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:00,585 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-07-23 15:34:00,586 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:34:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-07-23 15:34:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-07-23 15:34:00,587 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:00,587 INFO L353 BasicCegarLoop]: trace histogram [82, 82, 81, 1, 1] [2018-07-23 15:34:00,587 INFO L414 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2014959623, now seen corresponding path program 81 times [2018-07-23 15:34:00,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 0 proven. 9963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:01,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:01,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:34:01,046 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:34:01,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:34:01,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:34:01,047 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 84 states. [2018-07-23 15:34:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:01,119 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-07-23 15:34:01,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:34:01,119 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 247 [2018-07-23 15:34:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:01,121 INFO L225 Difference]: With dead ends: 252 [2018-07-23 15:34:01,121 INFO L226 Difference]: Without dead ends: 251 [2018-07-23 15:34:01,121 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:34:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-23 15:34:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-23 15:34:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-23 15:34:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-23 15:34:01,128 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-07-23 15:34:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:01,128 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-23 15:34:01,128 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:34:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-23 15:34:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-23 15:34:01,129 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:01,129 INFO L353 BasicCegarLoop]: trace histogram [83, 83, 82, 1, 1] [2018-07-23 15:34:01,130 INFO L414 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1199532660, now seen corresponding path program 82 times [2018-07-23 15:34:01,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 10209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:01,763 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:01,763 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:34:01,764 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:34:01,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:34:01,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:34:01,765 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 85 states. [2018-07-23 15:34:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:01,916 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-23 15:34:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:34:01,916 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 250 [2018-07-23 15:34:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:01,918 INFO L225 Difference]: With dead ends: 255 [2018-07-23 15:34:01,918 INFO L226 Difference]: Without dead ends: 254 [2018-07-23 15:34:01,919 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:34:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-23 15:34:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-07-23 15:34:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-07-23 15:34:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-07-23 15:34:01,956 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-07-23 15:34:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:01,956 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-07-23 15:34:01,956 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:34:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-07-23 15:34:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-07-23 15:34:01,957 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:01,957 INFO L353 BasicCegarLoop]: trace histogram [84, 84, 83, 1, 1] [2018-07-23 15:34:01,957 INFO L414 AbstractCegarLoop]: === Iteration 84 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1149904103, now seen corresponding path program 83 times [2018-07-23 15:34:01,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 0 proven. 10458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:02,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:02,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:34:02,393 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:34:02,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:34:02,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:34:02,395 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 86 states. [2018-07-23 15:34:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:02,504 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-07-23 15:34:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:34:02,504 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 253 [2018-07-23 15:34:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:02,505 INFO L225 Difference]: With dead ends: 258 [2018-07-23 15:34:02,505 INFO L226 Difference]: Without dead ends: 257 [2018-07-23 15:34:02,506 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:34:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-23 15:34:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-23 15:34:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 15:34:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-23 15:34:02,513 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-07-23 15:34:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:02,513 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-23 15:34:02,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:34:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-23 15:34:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-23 15:34:02,515 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:02,515 INFO L353 BasicCegarLoop]: trace histogram [85, 85, 84, 1, 1] [2018-07-23 15:34:02,515 INFO L414 AbstractCegarLoop]: === Iteration 85 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 134312340, now seen corresponding path program 84 times [2018-07-23 15:34:02,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 0 proven. 10710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:03,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:03,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:34:03,020 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:34:03,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:34:03,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:34:03,022 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 87 states. [2018-07-23 15:34:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:03,110 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-23 15:34:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:34:03,110 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 256 [2018-07-23 15:34:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:03,111 INFO L225 Difference]: With dead ends: 261 [2018-07-23 15:34:03,111 INFO L226 Difference]: Without dead ends: 260 [2018-07-23 15:34:03,111 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:34:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-07-23 15:34:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-07-23 15:34:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-23 15:34:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-07-23 15:34:03,119 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-07-23 15:34:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:03,119 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-07-23 15:34:03,119 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:34:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-07-23 15:34:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-07-23 15:34:03,121 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:03,122 INFO L353 BasicCegarLoop]: trace histogram [86, 86, 85, 1, 1] [2018-07-23 15:34:03,122 INFO L414 AbstractCegarLoop]: === Iteration 86 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1610266169, now seen corresponding path program 85 times [2018-07-23 15:34:03,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 0 proven. 10965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:03,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:03,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:34:03,625 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:34:03,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:34:03,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:34:03,626 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 88 states. [2018-07-23 15:34:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:03,829 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-07-23 15:34:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:34:03,829 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 259 [2018-07-23 15:34:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:03,831 INFO L225 Difference]: With dead ends: 264 [2018-07-23 15:34:03,831 INFO L226 Difference]: Without dead ends: 263 [2018-07-23 15:34:03,832 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:34:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-23 15:34:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-23 15:34:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-23 15:34:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-23 15:34:03,838 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-07-23 15:34:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:03,838 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-23 15:34:03,838 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:34:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-23 15:34:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-23 15:34:03,840 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:03,840 INFO L353 BasicCegarLoop]: trace histogram [87, 87, 86, 1, 1] [2018-07-23 15:34:03,840 INFO L414 AbstractCegarLoop]: === Iteration 87 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash -949378892, now seen corresponding path program 86 times [2018-07-23 15:34:03,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 0 proven. 11223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:04,423 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:04,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:34:04,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:34:04,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:34:04,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:34:04,425 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 89 states. [2018-07-23 15:34:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:04,584 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-23 15:34:04,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:34:04,584 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 262 [2018-07-23 15:34:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:04,585 INFO L225 Difference]: With dead ends: 267 [2018-07-23 15:34:04,585 INFO L226 Difference]: Without dead ends: 266 [2018-07-23 15:34:04,586 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:34:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-07-23 15:34:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-07-23 15:34:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-07-23 15:34:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-07-23 15:34:04,592 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-07-23 15:34:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-07-23 15:34:04,593 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:34:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-07-23 15:34:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-07-23 15:34:04,594 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:04,594 INFO L353 BasicCegarLoop]: trace histogram [88, 88, 87, 1, 1] [2018-07-23 15:34:04,595 INFO L414 AbstractCegarLoop]: === Iteration 88 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash -586594649, now seen corresponding path program 87 times [2018-07-23 15:34:04,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 0 proven. 11484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:05,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:05,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:34:05,145 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:34:05,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:34:05,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:34:05,147 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 90 states. [2018-07-23 15:34:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:05,319 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-07-23 15:34:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:34:05,320 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 265 [2018-07-23 15:34:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:05,321 INFO L225 Difference]: With dead ends: 270 [2018-07-23 15:34:05,321 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 15:34:05,322 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:34:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 15:34:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-23 15:34:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-23 15:34:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-23 15:34:05,329 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-07-23 15:34:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:05,329 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-23 15:34:05,329 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:34:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-23 15:34:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-23 15:34:05,331 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:05,331 INFO L353 BasicCegarLoop]: trace histogram [89, 89, 88, 1, 1] [2018-07-23 15:34:05,331 INFO L414 AbstractCegarLoop]: === Iteration 89 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 981071828, now seen corresponding path program 88 times [2018-07-23 15:34:05,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 0 proven. 11748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:05,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:05,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:34:05,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:34:05,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:34:05,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:34:05,852 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 91 states. [2018-07-23 15:34:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:05,986 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-23 15:34:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:34:05,987 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 268 [2018-07-23 15:34:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:05,988 INFO L225 Difference]: With dead ends: 273 [2018-07-23 15:34:05,988 INFO L226 Difference]: Without dead ends: 272 [2018-07-23 15:34:05,989 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:34:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-23 15:34:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2018-07-23 15:34:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-07-23 15:34:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-07-23 15:34:05,997 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-07-23 15:34:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:05,997 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-07-23 15:34:05,997 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:34:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-07-23 15:34:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-07-23 15:34:05,999 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:05,999 INFO L353 BasicCegarLoop]: trace histogram [90, 90, 89, 1, 1] [2018-07-23 15:34:05,999 INFO L414 AbstractCegarLoop]: === Iteration 90 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash -141288569, now seen corresponding path program 89 times [2018-07-23 15:34:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 0 proven. 12015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:06,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:06,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:34:06,562 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:34:06,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:34:06,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:34:06,563 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 92 states. [2018-07-23 15:34:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:06,655 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-07-23 15:34:06,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:34:06,655 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 271 [2018-07-23 15:34:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:06,656 INFO L225 Difference]: With dead ends: 276 [2018-07-23 15:34:06,656 INFO L226 Difference]: Without dead ends: 275 [2018-07-23 15:34:06,657 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:34:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-23 15:34:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-23 15:34:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-23 15:34:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-23 15:34:06,662 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-07-23 15:34:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:06,662 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-23 15:34:06,662 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:34:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-23 15:34:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-23 15:34:06,663 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:06,663 INFO L353 BasicCegarLoop]: trace histogram [91, 91, 90, 1, 1] [2018-07-23 15:34:06,663 INFO L414 AbstractCegarLoop]: === Iteration 91 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash -59476236, now seen corresponding path program 90 times [2018-07-23 15:34:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:07,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:07,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:34:07,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:34:07,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:34:07,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:34:07,372 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 93 states. [2018-07-23 15:34:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,575 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-23 15:34:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:34:07,575 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 274 [2018-07-23 15:34:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,577 INFO L225 Difference]: With dead ends: 279 [2018-07-23 15:34:07,577 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 15:34:07,577 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:34:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 15:34:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-07-23 15:34:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-07-23 15:34:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-07-23 15:34:07,583 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-07-23 15:34:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-07-23 15:34:07,584 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:34:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-07-23 15:34:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-07-23 15:34:07,585 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,585 INFO L353 BasicCegarLoop]: trace histogram [92, 92, 91, 1, 1] [2018-07-23 15:34:07,585 INFO L414 AbstractCegarLoop]: === Iteration 92 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1965279335, now seen corresponding path program 91 times [2018-07-23 15:34:07,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12558 backedges. 0 proven. 12558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:08,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:34:08,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:34:08,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:34:08,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:34:08,174 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 94 states. [2018-07-23 15:34:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:08,341 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-07-23 15:34:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:34:08,342 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 277 [2018-07-23 15:34:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:08,343 INFO L225 Difference]: With dead ends: 282 [2018-07-23 15:34:08,343 INFO L226 Difference]: Without dead ends: 281 [2018-07-23 15:34:08,344 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:34:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-23 15:34:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-23 15:34:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-23 15:34:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-23 15:34:08,349 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-07-23 15:34:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:08,349 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-23 15:34:08,349 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:34:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-23 15:34:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-23 15:34:08,350 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:08,351 INFO L353 BasicCegarLoop]: trace histogram [93, 93, 92, 1, 1] [2018-07-23 15:34:08,351 INFO L414 AbstractCegarLoop]: === Iteration 93 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1357177324, now seen corresponding path program 92 times [2018-07-23 15:34:08,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12834 backedges. 0 proven. 12834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:08,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:34:08,936 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:34:08,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:34:08,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:34:08,938 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 95 states. [2018-07-23 15:34:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:09,160 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-23 15:34:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:34:09,160 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 280 [2018-07-23 15:34:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:09,162 INFO L225 Difference]: With dead ends: 285 [2018-07-23 15:34:09,162 INFO L226 Difference]: Without dead ends: 284 [2018-07-23 15:34:09,163 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:34:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-23 15:34:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2018-07-23 15:34:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-07-23 15:34:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-07-23 15:34:09,170 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-07-23 15:34:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-07-23 15:34:09,171 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:34:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-07-23 15:34:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-07-23 15:34:09,172 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:09,173 INFO L353 BasicCegarLoop]: trace histogram [94, 94, 93, 1, 1] [2018-07-23 15:34:09,173 INFO L414 AbstractCegarLoop]: === Iteration 94 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:09,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1152798023, now seen corresponding path program 93 times [2018-07-23 15:34:09,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:09,828 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:09,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:34:09,829 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:34:09,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:34:09,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:34:09,831 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 96 states. [2018-07-23 15:34:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:09,974 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-07-23 15:34:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:34:09,974 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 283 [2018-07-23 15:34:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:09,975 INFO L225 Difference]: With dead ends: 288 [2018-07-23 15:34:09,976 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 15:34:09,976 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:34:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 15:34:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-23 15:34:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-23 15:34:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-23 15:34:09,984 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-07-23 15:34:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:09,984 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-23 15:34:09,984 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:34:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-23 15:34:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-23 15:34:09,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:09,986 INFO L353 BasicCegarLoop]: trace histogram [95, 95, 94, 1, 1] [2018-07-23 15:34:09,986 INFO L414 AbstractCegarLoop]: === Iteration 95 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash 447737140, now seen corresponding path program 94 times [2018-07-23 15:34:09,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:10,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:10,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:34:10,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:34:10,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:34:10,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:34:10,606 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 97 states. [2018-07-23 15:34:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:10,807 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-23 15:34:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:34:10,808 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 286 [2018-07-23 15:34:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:10,809 INFO L225 Difference]: With dead ends: 291 [2018-07-23 15:34:10,809 INFO L226 Difference]: Without dead ends: 290 [2018-07-23 15:34:10,810 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:34:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-23 15:34:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-07-23 15:34:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-07-23 15:34:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-07-23 15:34:10,817 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-07-23 15:34:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:10,818 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-07-23 15:34:10,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:34:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-07-23 15:34:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-07-23 15:34:10,819 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:10,820 INFO L353 BasicCegarLoop]: trace histogram [96, 96, 95, 1, 1] [2018-07-23 15:34:10,820 INFO L414 AbstractCegarLoop]: === Iteration 96 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:10,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1630950873, now seen corresponding path program 95 times [2018-07-23 15:34:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13680 backedges. 0 proven. 13680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:11,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:11,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:34:11,430 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:34:11,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:34:11,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:34:11,432 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 98 states. [2018-07-23 15:34:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:11,670 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-07-23 15:34:11,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:34:11,670 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 289 [2018-07-23 15:34:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:11,672 INFO L225 Difference]: With dead ends: 294 [2018-07-23 15:34:11,672 INFO L226 Difference]: Without dead ends: 293 [2018-07-23 15:34:11,672 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:34:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-23 15:34:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-23 15:34:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-23 15:34:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-23 15:34:11,678 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-07-23 15:34:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:11,678 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-23 15:34:11,678 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:34:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-23 15:34:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-23 15:34:11,680 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:11,680 INFO L353 BasicCegarLoop]: trace histogram [97, 97, 96, 1, 1] [2018-07-23 15:34:11,681 INFO L414 AbstractCegarLoop]: === Iteration 97 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1307894868, now seen corresponding path program 96 times [2018-07-23 15:34:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 0 proven. 13968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:12,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:12,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:34:12,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:34:12,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:34:12,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:34:12,383 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 99 states. [2018-07-23 15:34:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:12,651 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-23 15:34:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:34:12,651 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 292 [2018-07-23 15:34:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:12,653 INFO L225 Difference]: With dead ends: 297 [2018-07-23 15:34:12,653 INFO L226 Difference]: Without dead ends: 296 [2018-07-23 15:34:12,654 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:34:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-07-23 15:34:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-07-23 15:34:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-23 15:34:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-07-23 15:34:12,662 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-07-23 15:34:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:12,663 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-07-23 15:34:12,663 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:34:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-07-23 15:34:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-07-23 15:34:12,665 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:12,665 INFO L353 BasicCegarLoop]: trace histogram [98, 98, 97, 1, 1] [2018-07-23 15:34:12,665 INFO L414 AbstractCegarLoop]: === Iteration 98 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash -446963961, now seen corresponding path program 97 times [2018-07-23 15:34:12,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 0 proven. 14259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:13,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:13,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:34:13,526 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:34:13,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:34:13,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:34:13,527 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 100 states. [2018-07-23 15:34:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:13,796 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-07-23 15:34:13,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:34:13,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 295 [2018-07-23 15:34:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:13,798 INFO L225 Difference]: With dead ends: 300 [2018-07-23 15:34:13,798 INFO L226 Difference]: Without dead ends: 299 [2018-07-23 15:34:13,799 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:34:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-23 15:34:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-23 15:34:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-23 15:34:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-07-23 15:34:13,807 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-07-23 15:34:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:13,808 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-07-23 15:34:13,808 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:34:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-07-23 15:34:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-23 15:34:13,810 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:13,810 INFO L353 BasicCegarLoop]: trace histogram [99, 99, 98, 1, 1] [2018-07-23 15:34:13,810 INFO L414 AbstractCegarLoop]: === Iteration 99 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1104411788, now seen corresponding path program 98 times [2018-07-23 15:34:13,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 0 proven. 14553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:14,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:14,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:34:14,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:34:14,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:34:14,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:34:14,718 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 101 states. [2018-07-23 15:34:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:14,982 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-23 15:34:14,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:34:14,982 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 298 [2018-07-23 15:34:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:14,983 INFO L225 Difference]: With dead ends: 303 [2018-07-23 15:34:14,983 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 15:34:14,984 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:34:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 15:34:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-07-23 15:34:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-07-23 15:34:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-07-23 15:34:14,992 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-07-23 15:34:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:14,992 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-07-23 15:34:14,992 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:34:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-07-23 15:34:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-07-23 15:34:14,994 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:14,994 INFO L353 BasicCegarLoop]: trace histogram [100, 100, 99, 1, 1] [2018-07-23 15:34:14,994 INFO L414 AbstractCegarLoop]: === Iteration 100 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2081756185, now seen corresponding path program 99 times [2018-07-23 15:34:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 0 proven. 14850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:15,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:15,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:34:15,747 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:34:15,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:34:15,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:34:15,749 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 102 states. [2018-07-23 15:34:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:15,882 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-07-23 15:34:15,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:34:15,883 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 301 [2018-07-23 15:34:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:15,884 INFO L225 Difference]: With dead ends: 306 [2018-07-23 15:34:15,884 INFO L226 Difference]: Without dead ends: 305 [2018-07-23 15:34:15,886 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:34:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-23 15:34:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-23 15:34:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-23 15:34:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-23 15:34:15,894 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-07-23 15:34:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:15,895 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-23 15:34:15,895 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:34:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-23 15:34:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-23 15:34:15,896 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:15,897 INFO L353 BasicCegarLoop]: trace histogram [101, 101, 100, 1, 1] [2018-07-23 15:34:15,897 INFO L414 AbstractCegarLoop]: === Iteration 101 === [mainErr0AssertViolationASSERT]=== [2018-07-23 15:34:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1729579668, now seen corresponding path program 100 times [2018-07-23 15:34:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 15050 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:16,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:16,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 15:34:16,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 15:34:16,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 15:34:16,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:34:16,811 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 104 states. [2018-07-23 15:34:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:17,119 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-23 15:34:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 15:34:17,119 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 304 [2018-07-23 15:34:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:17,120 INFO L225 Difference]: With dead ends: 307 [2018-07-23 15:34:17,120 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:34:17,124 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5359, Invalid=5561, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:34:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:34:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:34:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:34:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:34:17,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2018-07-23 15:34:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:17,126 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:34:17,126 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 15:34:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:34:17,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:34:17,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:34:17,847 WARN L169 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 605 [2018-07-23 15:34:18,193 WARN L169 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-07-23 15:34:18,631 WARN L169 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 607 [2018-07-23 15:34:18,637 INFO L417 ceAbstractionStarter]: At program point mainErr0AssertViolationASSERT(line 17) the Hoare annotation is: false [2018-07-23 15:34:18,638 INFO L421 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-07-23 15:34:18,647 INFO L417 ceAbstractionStarter]: At program point L13(lines 13 22) the Hoare annotation is: (let ((.cse0 (select |#length| main_q.base))) (let ((.cse1 (= 400 .cse0))) (or (and (<= (+ main_q.offset 108) .cse0) (<= (+ main_p.offset 292) main_q.offset)) (and (<= (+ main_q.offset 356) .cse0) (<= (+ main_p.offset 44) main_q.offset)) (and (<= (+ main_q.offset 340) .cse0) (<= (+ main_p.offset 60) main_q.offset)) (and (<= (+ main_q.offset 232) .cse0) (<= (+ main_p.offset 168) main_q.offset)) (and (<= (+ main_q.offset 148) .cse0) (<= (+ main_p.offset 252) main_q.offset)) (and (<= (+ main_q.offset 368) .cse0) (<= (+ main_p.offset 32) main_q.offset)) (and (<= (+ main_p.offset 352) main_q.offset) (<= (+ main_q.offset 48) .cse0)) (and (<= (+ main_p.offset 364) main_q.offset) (<= (+ main_q.offset 36) .cse0)) (and (<= (+ main_p.offset 88) main_q.offset) (<= (+ main_q.offset 312) .cse0)) (and (<= (+ main_p.offset 288) main_q.offset) (<= (+ main_q.offset 112) .cse0)) (and (<= (+ main_p.offset 384) main_q.offset) (<= (+ main_q.offset 16) .cse0)) (and (<= (+ main_p.offset 116) main_q.offset) (<= (+ main_q.offset 284) .cse0)) (and (<= (+ main_q.offset 236) .cse0) (<= (+ main_p.offset 164) main_q.offset)) (and (<= (+ main_q.offset 160) .cse0) (<= (+ main_p.offset 240) main_q.offset)) (and (<= (+ main_p.offset 316) main_q.offset) (<= (+ main_q.offset 84) .cse0)) (and (<= (+ main_p.offset 156) main_q.offset) (<= (+ main_q.offset 244) .cse0)) (and (<= (+ main_p.offset 204) main_q.offset) (<= (+ main_q.offset 196) .cse0)) (and (<= (+ main_p.offset 376) main_q.offset) (<= (+ main_q.offset 24) .cse0)) (and (<= (+ main_q.offset 80) .cse0) (<= (+ main_p.offset 320) main_q.offset)) (and (<= (+ main_q.offset 220) .cse0) (<= (+ main_p.offset 180) main_q.offset)) (and (<= (+ main_q.offset 276) .cse0) (<= (+ main_p.offset 124) main_q.offset)) (and (<= (+ main_p.offset 368) main_q.offset) (<= (+ main_q.offset 32) .cse0)) (and (<= (+ main_q.offset 240) .cse0) (<= (+ main_p.offset 160) main_q.offset)) (and (<= (+ main_q.offset 228) .cse0) (<= (+ main_p.offset 172) main_q.offset)) (and (<= (+ main_q.offset 64) .cse0) (<= (+ main_p.offset 336) main_q.offset)) (and (<= (+ main_p.offset 120) main_q.offset) (<= (+ main_q.offset 280) .cse0)) (and (<= (+ main_q.offset 92) .cse0) (<= (+ main_p.offset 308) main_q.offset)) (and (<= (+ main_p.offset 48) main_q.offset) (<= (+ main_q.offset 352) .cse0)) (and (<= (+ main_p.offset 96) main_q.offset) (<= (+ main_q.offset 304) .cse0)) (and (<= (+ main_p.offset 396) main_q.offset) (<= (+ main_q.offset 4) .cse0)) (and (<= (+ main_q.offset 272) .cse0) (<= (+ main_p.offset 128) main_q.offset)) (and (<= (+ main_p.offset 100) main_q.offset) (<= (+ main_q.offset 300) .cse0)) (and (<= (+ main_p.offset 148) main_q.offset) (<= (+ main_q.offset 252) .cse0)) (and (<= (+ main_q.offset 164) .cse0) (<= (+ main_p.offset 236) main_q.offset)) (and (<= (+ main_p.offset 16) main_q.offset) (<= (+ main_q.offset 384) .cse0)) (and (<= (+ main_p.offset 20) main_q.offset) (<= (+ main_q.offset 380) .cse0)) (and (<= (+ main_p.offset 52) main_q.offset) (<= (+ main_q.offset 348) .cse0)) (and (<= (+ main_q.offset 20) .cse0) (<= (+ main_p.offset 380) main_q.offset)) (and (<= (+ main_p.offset 56) main_q.offset) (<= (+ main_q.offset 344) .cse0)) (and (<= (+ main_p.offset 328) main_q.offset) (<= (+ main_q.offset 72) .cse0)) (and (<= (+ main_p.offset 344) main_q.offset) (<= (+ main_q.offset 56) .cse0)) (and (<= (+ main_q.offset 288) .cse0) (<= (+ main_p.offset 112) main_q.offset)) (and (<= (+ main_q.offset 372) .cse0) (<= (+ main_p.offset 28) main_q.offset)) (and (<= (+ main_p.offset 312) main_q.offset) (<= (+ main_q.offset 88) .cse0)) (and (<= (+ main_p.offset 216) main_q.offset) (<= (+ main_q.offset 184) .cse0)) (and (<= (+ main_p.offset 136) main_q.offset) (<= (+ main_q.offset 264) .cse0)) (and (<= (+ main_p.offset 188) main_q.offset) (<= (+ main_q.offset 212) .cse0)) (and (<= (+ main_q.offset 172) .cse0) (<= (+ main_p.offset 228) main_q.offset)) (and (<= (+ main_p.offset 108) main_q.offset) (<= (+ main_q.offset 292) .cse0)) (and (<= (+ main_p.offset 8) main_q.offset) (<= (+ main_q.offset 392) .cse0)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 296) main_q.offset) (<= (+ main_q.offset 104) .cse0)) (and (<= (+ main_p.offset 300) main_q.offset) (<= (+ main_q.offset 100) .cse0)) (and (<= (+ main_p.offset 200) main_q.offset) (<= (+ main_q.offset 200) .cse0)) (and (<= (+ main_p.offset 256) main_q.offset) (<= (+ main_q.offset 144) .cse0)) (and (<= (+ main_p.offset 192) main_q.offset) (<= (+ main_q.offset 208) .cse0)) (and (<= (+ main_p.offset 24) main_q.offset) (<= (+ main_q.offset 376) .cse0)) (and (<= (+ main_p.offset 208) main_q.offset) (<= (+ main_q.offset 192) .cse0)) (and (<= (+ main_q.offset 328) .cse0) (<= (+ main_p.offset 72) main_q.offset)) (and (<= (+ main_p.offset 284) main_q.offset) (<= (+ main_q.offset 116) .cse0)) (and (<= (+ main_q.offset 180) .cse0) (<= (+ main_p.offset 220) main_q.offset)) (and (<= (+ main_q.offset 60) .cse0) (<= (+ main_p.offset 340) main_q.offset)) (and (<= (+ main_q.offset 8) .cse0) (<= (+ main_p.offset 392) main_q.offset)) (and (<= (+ main_q.offset 260) .cse0) (<= (+ main_p.offset 140) main_q.offset)) (and (<= (+ main_p.offset 388) main_q.offset) (<= (+ main_q.offset 12) .cse0)) (and (<= (+ main_p.offset 232) main_q.offset) (<= (+ main_q.offset 168) .cse0)) (and (<= (+ main_q.offset 52) .cse0) (<= (+ main_p.offset 348) main_q.offset)) (and (<= (+ main_q.offset 388) .cse0) (<= (+ main_p.offset 12) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= (+ main_q.offset 320) .cse0)) (and (<= (+ main_q.offset 316) .cse0) (<= (+ main_p.offset 84) main_q.offset)) (and (<= (+ main_p.offset 196) main_q.offset) (<= (+ main_q.offset 204) .cse0)) (and (<= (+ main_q.offset 156) .cse0) (<= (+ main_p.offset 244) main_q.offset)) (and (<= (+ main_q.offset 188) .cse0) (<= (+ main_p.offset 212) main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= (+ main_q.offset 360) .cse0)) (and (<= (+ main_p.offset 248) main_q.offset) (<= (+ main_q.offset 152) .cse0)) (and (<= (+ main_p.offset 64) main_q.offset) (<= (+ main_q.offset 336) .cse0)) (and (<= (+ main_q.offset 224) .cse0) (<= (+ main_p.offset 176) main_q.offset)) (and (<= (+ main_p.offset 36) main_q.offset) (<= (+ main_q.offset 364) .cse0)) (and (<= (+ main_p.offset 132) main_q.offset) (<= (+ main_q.offset 268) .cse0)) (and (<= (+ main_q.offset 140) .cse0) (<= (+ main_p.offset 260) main_q.offset)) (and (<= (+ main_p.offset 76) main_q.offset) (<= (+ main_q.offset 324) .cse0)) (and (<= (+ main_p.offset 276) main_q.offset) (<= (+ main_q.offset 124) .cse0)) (and (<= (+ main_q.offset 76) .cse0) (<= (+ main_p.offset 324) main_q.offset)) (and (<= (+ main_p.offset 304) main_q.offset) (<= (+ main_q.offset 96) .cse0)) (and (<= (+ main_q.offset 248) .cse0) (<= (+ main_p.offset 152) main_q.offset)) (and (<= (+ main_p.offset 280) main_q.offset) (<= (+ main_q.offset 120) .cse0)) (and (<= (+ main_q.offset 308) .cse0) (<= (+ main_p.offset 92) main_q.offset)) (and (<= (+ main_p.offset 268) main_q.offset) (<= (+ main_q.offset 132) .cse0)) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse1) (and (<= (+ main_p.offset 356) main_q.offset) (<= (+ main_q.offset 44) .cse0)) (and (<= (+ main_p.offset 272) main_q.offset) (<= (+ main_q.offset 128) .cse0)) (and (<= (+ main_q.offset 216) .cse0) (<= (+ main_p.offset 184) main_q.offset)) (and (<= (+ main_p.offset 68) main_q.offset) (<= (+ main_q.offset 332) .cse0)) (and (<= (+ main_q.offset 176) .cse0) (<= (+ main_p.offset 224) main_q.offset)) (and (<= (+ main_q.offset 40) .cse0) (<= (+ main_p.offset 360) main_q.offset)) (and (<= (+ main_q.offset 136) .cse0) (<= (+ main_p.offset 264) main_q.offset)) (and (<= (+ main_q.offset 28) .cse0) (<= (+ main_p.offset 372) main_q.offset)) (and (<= (+ main_q.offset 68) .cse0) (<= (+ main_p.offset 332) main_q.offset)) (and (<= main_q.offset 4) .cse1 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_q.offset 256) .cse0) (<= (+ main_p.offset 144) main_q.offset)) (and (<= (+ main_p.offset 104) main_q.offset) (<= (+ main_q.offset 296) .cse0))))) [2018-07-23 15:34:18,647 INFO L424 ceAbstractionStarter]: At program point mainEXIT(lines 3 24) the Hoare annotation is: true [2018-07-23 15:34:18,647 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 3 24) the Hoare annotation is: true [2018-07-23 15:34:18,653 INFO L417 ceAbstractionStarter]: At program point L16(lines 16 20) the Hoare annotation is: (let ((.cse0 (select |#length| main_q.base))) (let ((.cse1 (= 400 .cse0))) (or (and (<= (+ main_q.offset 108) .cse0) (<= (+ main_p.offset 292) main_q.offset)) (and (<= (+ main_q.offset 356) .cse0) (<= (+ main_p.offset 44) main_q.offset)) (and (<= (+ main_q.offset 340) .cse0) (<= (+ main_p.offset 60) main_q.offset)) (and (<= (+ main_q.offset 232) .cse0) (<= (+ main_p.offset 168) main_q.offset)) (and (<= (+ main_q.offset 148) .cse0) (<= (+ main_p.offset 252) main_q.offset)) (and (<= (+ main_q.offset 368) .cse0) (<= (+ main_p.offset 32) main_q.offset)) (and (<= (+ main_p.offset 352) main_q.offset) (<= (+ main_q.offset 48) .cse0)) (and (<= (+ main_p.offset 364) main_q.offset) (<= (+ main_q.offset 36) .cse0)) (and (<= (+ main_p.offset 88) main_q.offset) (<= (+ main_q.offset 312) .cse0)) (and (<= (+ main_p.offset 288) main_q.offset) (<= (+ main_q.offset 112) .cse0)) (and (<= (+ main_p.offset 384) main_q.offset) (<= (+ main_q.offset 16) .cse0)) (and (<= (+ main_p.offset 116) main_q.offset) (<= (+ main_q.offset 284) .cse0)) (and (<= (+ main_q.offset 236) .cse0) (<= (+ main_p.offset 164) main_q.offset)) (and (<= (+ main_q.offset 160) .cse0) (<= (+ main_p.offset 240) main_q.offset)) (and (<= (+ main_p.offset 316) main_q.offset) (<= (+ main_q.offset 84) .cse0)) (and (<= (+ main_p.offset 156) main_q.offset) (<= (+ main_q.offset 244) .cse0)) (and (not |main_#t~short2|) (<= (+ main_p.offset 400) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= (+ main_q.offset 196) .cse0)) (and (<= (+ main_p.offset 376) main_q.offset) (<= (+ main_q.offset 24) .cse0)) (and (<= (+ main_q.offset 80) .cse0) (<= (+ main_p.offset 320) main_q.offset)) (and (<= (+ main_q.offset 220) .cse0) (<= (+ main_p.offset 180) main_q.offset)) (and (<= (+ main_q.offset 276) .cse0) (<= (+ main_p.offset 124) main_q.offset)) (and (<= (+ main_p.offset 368) main_q.offset) (<= (+ main_q.offset 32) .cse0)) (and (<= (+ main_q.offset 240) .cse0) (<= (+ main_p.offset 160) main_q.offset)) (and (<= (+ main_q.offset 228) .cse0) (<= (+ main_p.offset 172) main_q.offset)) (and (<= (+ main_q.offset 64) .cse0) (<= (+ main_p.offset 336) main_q.offset)) (and (<= (+ main_p.offset 120) main_q.offset) (<= (+ main_q.offset 280) .cse0)) (and (<= (+ main_q.offset 92) .cse0) (<= (+ main_p.offset 308) main_q.offset)) (and (<= (+ main_p.offset 48) main_q.offset) (<= (+ main_q.offset 352) .cse0)) (and (<= (+ main_p.offset 96) main_q.offset) (<= (+ main_q.offset 304) .cse0)) (and (<= (+ main_p.offset 396) main_q.offset) (<= (+ main_q.offset 4) .cse0)) (and (<= (+ main_q.offset 272) .cse0) (<= (+ main_p.offset 128) main_q.offset)) (and (<= (+ main_p.offset 100) main_q.offset) (<= (+ main_q.offset 300) .cse0)) (and (<= (+ main_p.offset 148) main_q.offset) (<= (+ main_q.offset 252) .cse0)) (and (<= (+ main_q.offset 164) .cse0) (<= (+ main_p.offset 236) main_q.offset)) (and (<= (+ main_p.offset 16) main_q.offset) (<= (+ main_q.offset 384) .cse0)) (and (<= (+ main_p.offset 20) main_q.offset) (<= (+ main_q.offset 380) .cse0)) (and (<= (+ main_p.offset 52) main_q.offset) (<= (+ main_q.offset 348) .cse0)) (and (<= (+ main_q.offset 20) .cse0) (<= (+ main_p.offset 380) main_q.offset)) (and (<= (+ main_p.offset 56) main_q.offset) (<= (+ main_q.offset 344) .cse0)) (and (<= (+ main_p.offset 328) main_q.offset) (<= (+ main_q.offset 72) .cse0)) (and (<= (+ main_p.offset 344) main_q.offset) (<= (+ main_q.offset 56) .cse0)) (and (<= (+ main_q.offset 288) .cse0) (<= (+ main_p.offset 112) main_q.offset)) (and (<= (+ main_q.offset 372) .cse0) (<= (+ main_p.offset 28) main_q.offset)) (and (<= (+ main_p.offset 312) main_q.offset) (<= (+ main_q.offset 88) .cse0)) (and (<= (+ main_p.offset 216) main_q.offset) (<= (+ main_q.offset 184) .cse0)) (and (<= (+ main_p.offset 136) main_q.offset) (<= (+ main_q.offset 264) .cse0)) (and (<= (+ main_p.offset 188) main_q.offset) (<= (+ main_q.offset 212) .cse0)) (and (<= (+ main_q.offset 172) .cse0) (<= (+ main_p.offset 228) main_q.offset)) (and (<= (+ main_p.offset 108) main_q.offset) (<= (+ main_q.offset 292) .cse0)) (and (<= (+ main_p.offset 8) main_q.offset) (<= (+ main_q.offset 392) .cse0)) (and (<= (+ main_p.offset 296) main_q.offset) (<= (+ main_q.offset 104) .cse0)) (and (<= (+ main_p.offset 300) main_q.offset) (<= (+ main_q.offset 100) .cse0)) (and (<= (+ main_p.offset 200) main_q.offset) (<= (+ main_q.offset 200) .cse0)) (and (<= (+ main_p.offset 256) main_q.offset) (<= (+ main_q.offset 144) .cse0)) (and (<= (+ main_p.offset 192) main_q.offset) (<= (+ main_q.offset 208) .cse0)) (and (<= (+ main_p.offset 24) main_q.offset) (<= (+ main_q.offset 376) .cse0)) (and (<= (+ main_p.offset 208) main_q.offset) (<= (+ main_q.offset 192) .cse0)) (and (<= (+ main_q.offset 328) .cse0) (<= (+ main_p.offset 72) main_q.offset)) (and (<= (+ main_p.offset 284) main_q.offset) (<= (+ main_q.offset 116) .cse0)) (and (<= (+ main_q.offset 180) .cse0) (<= (+ main_p.offset 220) main_q.offset)) (and (<= (+ main_q.offset 60) .cse0) (<= (+ main_p.offset 340) main_q.offset)) (and (<= (+ main_q.offset 8) .cse0) (<= (+ main_p.offset 392) main_q.offset)) (and (<= (+ main_q.offset 260) .cse0) (<= (+ main_p.offset 140) main_q.offset)) (and (<= (+ main_p.offset 388) main_q.offset) (<= (+ main_q.offset 12) .cse0)) (and (<= (+ main_p.offset 232) main_q.offset) (<= (+ main_q.offset 168) .cse0)) (and (<= (+ main_q.offset 52) .cse0) (<= (+ main_p.offset 348) main_q.offset)) (and (<= (+ main_q.offset 388) .cse0) (<= (+ main_p.offset 12) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= (+ main_q.offset 320) .cse0)) (and (<= (+ main_q.offset 316) .cse0) (<= (+ main_p.offset 84) main_q.offset)) (and (<= (+ main_p.offset 196) main_q.offset) (<= (+ main_q.offset 204) .cse0)) (and (<= (+ main_q.offset 156) .cse0) (<= (+ main_p.offset 244) main_q.offset)) (and (<= (+ main_q.offset 188) .cse0) (<= (+ main_p.offset 212) main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= (+ main_q.offset 360) .cse0)) (and (<= (+ main_p.offset 248) main_q.offset) (<= (+ main_q.offset 152) .cse0)) (and (<= (+ main_p.offset 64) main_q.offset) (<= (+ main_q.offset 336) .cse0)) (and (<= (+ main_q.offset 224) .cse0) (<= (+ main_p.offset 176) main_q.offset)) (and (<= (+ main_p.offset 36) main_q.offset) (<= (+ main_q.offset 364) .cse0)) (and (<= (+ main_p.offset 132) main_q.offset) (<= (+ main_q.offset 268) .cse0)) (and (<= (+ main_q.offset 140) .cse0) (<= (+ main_p.offset 260) main_q.offset)) (and (<= (+ main_p.offset 76) main_q.offset) (<= (+ main_q.offset 324) .cse0)) (and (<= (+ main_p.offset 276) main_q.offset) (<= (+ main_q.offset 124) .cse0)) (and (<= (+ main_q.offset 76) .cse0) (<= (+ main_p.offset 324) main_q.offset)) (and (<= (+ main_p.offset 304) main_q.offset) (<= (+ main_q.offset 96) .cse0)) (and (<= (+ main_q.offset 248) .cse0) (<= (+ main_p.offset 152) main_q.offset)) (and (<= (+ main_p.offset 280) main_q.offset) (<= (+ main_q.offset 120) .cse0)) (and (<= (+ main_q.offset 308) .cse0) (<= (+ main_p.offset 92) main_q.offset)) (and (<= (+ main_p.offset 268) main_q.offset) (<= (+ main_q.offset 132) .cse0)) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse1) (and (<= (+ main_p.offset 356) main_q.offset) (<= (+ main_q.offset 44) .cse0)) (and (<= (+ main_p.offset 272) main_q.offset) (<= (+ main_q.offset 128) .cse0)) (and (<= (+ main_q.offset 216) .cse0) (<= (+ main_p.offset 184) main_q.offset)) (and (<= (+ main_p.offset 68) main_q.offset) (<= (+ main_q.offset 332) .cse0)) (and (<= (+ main_q.offset 176) .cse0) (<= (+ main_p.offset 224) main_q.offset)) (and (<= (+ main_q.offset 40) .cse0) (<= (+ main_p.offset 360) main_q.offset)) (and (<= (+ main_q.offset 136) .cse0) (<= (+ main_p.offset 264) main_q.offset)) (and (<= (+ main_q.offset 28) .cse0) (<= (+ main_p.offset 372) main_q.offset)) (and (<= (+ main_q.offset 68) .cse0) (<= (+ main_p.offset 332) main_q.offset)) (and (<= main_q.offset 4) .cse1 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_q.offset 256) .cse0) (<= (+ main_p.offset 144) main_q.offset)) (and (<= (+ main_p.offset 104) main_q.offset) (<= (+ main_q.offset 296) .cse0))))) [2018-07-23 15:34:18,658 INFO L417 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (let ((.cse0 (select |#length| main_q.base))) (let ((.cse1 (= 400 .cse0))) (or (and (<= (+ main_q.offset 108) .cse0) (<= (+ main_p.offset 292) main_q.offset)) (and (<= (+ main_q.offset 356) .cse0) (<= (+ main_p.offset 44) main_q.offset)) (and (<= (+ main_q.offset 340) .cse0) (<= (+ main_p.offset 60) main_q.offset)) (and (<= (+ main_q.offset 232) .cse0) (<= (+ main_p.offset 168) main_q.offset)) (and (<= (+ main_q.offset 148) .cse0) (<= (+ main_p.offset 252) main_q.offset)) (and (<= (+ main_q.offset 368) .cse0) (<= (+ main_p.offset 32) main_q.offset)) (and (<= (+ main_p.offset 352) main_q.offset) (<= (+ main_q.offset 48) .cse0)) (and (<= (+ main_p.offset 364) main_q.offset) (<= (+ main_q.offset 36) .cse0)) (and (<= (+ main_p.offset 88) main_q.offset) (<= (+ main_q.offset 312) .cse0)) (and (<= (+ main_p.offset 288) main_q.offset) (<= (+ main_q.offset 112) .cse0)) (and (<= (+ main_p.offset 384) main_q.offset) (<= (+ main_q.offset 16) .cse0)) (and (<= (+ main_p.offset 116) main_q.offset) (<= (+ main_q.offset 284) .cse0)) (and (<= (+ main_q.offset 236) .cse0) (<= (+ main_p.offset 164) main_q.offset)) (and (<= (+ main_q.offset 160) .cse0) (<= (+ main_p.offset 240) main_q.offset)) (and (<= (+ main_p.offset 316) main_q.offset) (<= (+ main_q.offset 84) .cse0)) (and (<= (+ main_p.offset 156) main_q.offset) (<= (+ main_q.offset 244) .cse0)) (and (<= (+ main_p.offset 204) main_q.offset) (<= (+ main_q.offset 196) .cse0)) (and (<= (+ main_p.offset 376) main_q.offset) (<= (+ main_q.offset 24) .cse0)) (and (<= (+ main_q.offset 80) .cse0) (<= (+ main_p.offset 320) main_q.offset)) (and (<= (+ main_q.offset 220) .cse0) (<= (+ main_p.offset 180) main_q.offset)) (and (<= (+ main_q.offset 276) .cse0) (<= (+ main_p.offset 124) main_q.offset)) (and (<= (+ main_p.offset 368) main_q.offset) (<= (+ main_q.offset 32) .cse0)) (and (<= (+ main_q.offset 240) .cse0) (<= (+ main_p.offset 160) main_q.offset)) (and (<= (+ main_q.offset 228) .cse0) (<= (+ main_p.offset 172) main_q.offset)) (and (<= (+ main_q.offset 64) .cse0) (<= (+ main_p.offset 336) main_q.offset)) (and (<= (+ main_p.offset 120) main_q.offset) (<= (+ main_q.offset 280) .cse0)) (and (<= (+ main_q.offset 92) .cse0) (<= (+ main_p.offset 308) main_q.offset)) (and (<= (+ main_p.offset 48) main_q.offset) (<= (+ main_q.offset 352) .cse0)) (and (<= (+ main_p.offset 96) main_q.offset) (<= (+ main_q.offset 304) .cse0)) (and (<= (+ main_p.offset 396) main_q.offset) (<= (+ main_q.offset 4) .cse0)) (and (<= (+ main_q.offset 272) .cse0) (<= (+ main_p.offset 128) main_q.offset)) (and (<= (+ main_p.offset 100) main_q.offset) (<= (+ main_q.offset 300) .cse0)) (and (<= (+ main_p.offset 148) main_q.offset) (<= (+ main_q.offset 252) .cse0)) (and (<= (+ main_q.offset 164) .cse0) (<= (+ main_p.offset 236) main_q.offset)) (and (<= (+ main_p.offset 16) main_q.offset) (<= (+ main_q.offset 384) .cse0)) (and (<= (+ main_p.offset 20) main_q.offset) (<= (+ main_q.offset 380) .cse0)) (and (<= (+ main_p.offset 52) main_q.offset) (<= (+ main_q.offset 348) .cse0)) (and (<= (+ main_q.offset 20) .cse0) (<= (+ main_p.offset 380) main_q.offset)) (and (<= (+ main_p.offset 56) main_q.offset) (<= (+ main_q.offset 344) .cse0)) (and (<= (+ main_p.offset 328) main_q.offset) (<= (+ main_q.offset 72) .cse0)) (and (<= (+ main_p.offset 344) main_q.offset) (<= (+ main_q.offset 56) .cse0)) (and (<= (+ main_q.offset 288) .cse0) (<= (+ main_p.offset 112) main_q.offset)) (and (<= (+ main_q.offset 372) .cse0) (<= (+ main_p.offset 28) main_q.offset)) (and (<= (+ main_p.offset 312) main_q.offset) (<= (+ main_q.offset 88) .cse0)) (and (<= (+ main_p.offset 216) main_q.offset) (<= (+ main_q.offset 184) .cse0)) (and (<= (+ main_p.offset 136) main_q.offset) (<= (+ main_q.offset 264) .cse0)) (and (<= (+ main_p.offset 188) main_q.offset) (<= (+ main_q.offset 212) .cse0)) (and (<= (+ main_q.offset 172) .cse0) (<= (+ main_p.offset 228) main_q.offset)) (and (<= (+ main_p.offset 108) main_q.offset) (<= (+ main_q.offset 292) .cse0)) (and (<= (+ main_p.offset 8) main_q.offset) (<= (+ main_q.offset 392) .cse0)) (and (<= (+ main_p.offset 296) main_q.offset) (<= (+ main_q.offset 104) .cse0)) (and (<= (+ main_p.offset 300) main_q.offset) (<= (+ main_q.offset 100) .cse0)) (and (<= (+ main_p.offset 200) main_q.offset) (<= (+ main_q.offset 200) .cse0)) (and (<= (+ main_p.offset 256) main_q.offset) (<= (+ main_q.offset 144) .cse0)) (and (<= (+ main_p.offset 192) main_q.offset) (<= (+ main_q.offset 208) .cse0)) (and (<= (+ main_p.offset 24) main_q.offset) (<= (+ main_q.offset 376) .cse0)) (and (<= (+ main_p.offset 208) main_q.offset) (<= (+ main_q.offset 192) .cse0)) (and (<= (+ main_q.offset 328) .cse0) (<= (+ main_p.offset 72) main_q.offset)) (and (<= (+ main_p.offset 284) main_q.offset) (<= (+ main_q.offset 116) .cse0)) (and (<= (+ main_q.offset 180) .cse0) (<= (+ main_p.offset 220) main_q.offset)) (and (<= (+ main_q.offset 60) .cse0) (<= (+ main_p.offset 340) main_q.offset)) (and (<= (+ main_q.offset 8) .cse0) (<= (+ main_p.offset 392) main_q.offset)) (and (<= (+ main_q.offset 260) .cse0) (<= (+ main_p.offset 140) main_q.offset)) (and (<= (+ main_p.offset 388) main_q.offset) (<= (+ main_q.offset 12) .cse0)) (and (<= (+ main_p.offset 232) main_q.offset) (<= (+ main_q.offset 168) .cse0)) (and (<= (+ main_q.offset 52) .cse0) (<= (+ main_p.offset 348) main_q.offset)) (and (<= (+ main_q.offset 388) .cse0) (<= (+ main_p.offset 12) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= (+ main_q.offset 320) .cse0)) (and (<= (+ main_q.offset 316) .cse0) (<= (+ main_p.offset 84) main_q.offset)) (and (<= (+ main_p.offset 196) main_q.offset) (<= (+ main_q.offset 204) .cse0)) (and (<= (+ main_q.offset 156) .cse0) (<= (+ main_p.offset 244) main_q.offset)) (and (<= (+ main_q.offset 188) .cse0) (<= (+ main_p.offset 212) main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= (+ main_q.offset 360) .cse0)) (and (<= (+ main_p.offset 248) main_q.offset) (<= (+ main_q.offset 152) .cse0)) (and (<= (+ main_p.offset 64) main_q.offset) (<= (+ main_q.offset 336) .cse0)) (and (<= (+ main_q.offset 224) .cse0) (<= (+ main_p.offset 176) main_q.offset)) (and (<= (+ main_p.offset 36) main_q.offset) (<= (+ main_q.offset 364) .cse0)) (and (<= (+ main_p.offset 132) main_q.offset) (<= (+ main_q.offset 268) .cse0)) (and (<= (+ main_q.offset 140) .cse0) (<= (+ main_p.offset 260) main_q.offset)) (and (<= (+ main_p.offset 76) main_q.offset) (<= (+ main_q.offset 324) .cse0)) (and (<= (+ main_p.offset 276) main_q.offset) (<= (+ main_q.offset 124) .cse0)) (and (<= (+ main_q.offset 76) .cse0) (<= (+ main_p.offset 324) main_q.offset)) (and (<= (+ main_p.offset 304) main_q.offset) (<= (+ main_q.offset 96) .cse0)) (and (<= (+ main_q.offset 248) .cse0) (<= (+ main_p.offset 152) main_q.offset)) (and (<= (+ main_p.offset 280) main_q.offset) (<= (+ main_q.offset 120) .cse0)) (and (<= (+ main_q.offset 308) .cse0) (<= (+ main_p.offset 92) main_q.offset)) (and (<= (+ main_p.offset 268) main_q.offset) (<= (+ main_q.offset 132) .cse0)) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse1) (and (<= (+ main_p.offset 356) main_q.offset) (<= (+ main_q.offset 44) .cse0)) (and (<= (+ main_p.offset 272) main_q.offset) (<= (+ main_q.offset 128) .cse0)) (and (<= (+ main_q.offset 216) .cse0) (<= (+ main_p.offset 184) main_q.offset)) (and (<= (+ main_p.offset 68) main_q.offset) (<= (+ main_q.offset 332) .cse0)) (and (<= (+ main_q.offset 176) .cse0) (<= (+ main_p.offset 224) main_q.offset)) (and (<= (+ main_q.offset 40) .cse0) (<= (+ main_p.offset 360) main_q.offset)) (and (<= (+ main_q.offset 136) .cse0) (<= (+ main_p.offset 264) main_q.offset)) (and (<= (+ main_q.offset 28) .cse0) (<= (+ main_p.offset 372) main_q.offset)) (and (<= (+ main_q.offset 68) .cse0) (<= (+ main_p.offset 332) main_q.offset)) (and (<= main_q.offset 4) .cse1 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_q.offset 256) .cse0) (<= (+ main_p.offset 144) main_q.offset)) (and (<= (+ main_p.offset 104) main_q.offset) (<= (+ main_q.offset 296) .cse0))))) [2018-07-23 15:34:18,659 INFO L421 ceAbstractionStarter]: For program point L16'(lines 16 20) no Hoare annotation was computed. [2018-07-23 15:34:18,659 INFO L424 ceAbstractionStarter]: At program point L13'(lines 3 24) the Hoare annotation is: true [2018-07-23 15:34:18,742 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:34:18 BoogieIcfgContainer [2018-07-23 15:34:18,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:34:18,746 INFO L168 Benchmark]: Toolchain (without parser) took 50479.43 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-07-23 15:34:18,747 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:34:18,749 INFO L168 Benchmark]: Boogie Preprocessor took 52.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:34:18,750 INFO L168 Benchmark]: RCFGBuilder took 231.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:34:18,751 INFO L168 Benchmark]: TraceAbstraction took 50191.14 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-07-23 15:34:18,757 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 231.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50191.14 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset + 108 <= #length[q!base] && p!offset + 292 <= q!offset) || (q!offset + 356 <= #length[q!base] && p!offset + 44 <= q!offset)) || (q!offset + 340 <= #length[q!base] && p!offset + 60 <= q!offset)) || (q!offset + 232 <= #length[q!base] && p!offset + 168 <= q!offset)) || (q!offset + 148 <= #length[q!base] && p!offset + 252 <= q!offset)) || (q!offset + 368 <= #length[q!base] && p!offset + 32 <= q!offset)) || (p!offset + 352 <= q!offset && q!offset + 48 <= #length[q!base])) || (p!offset + 364 <= q!offset && q!offset + 36 <= #length[q!base])) || (p!offset + 88 <= q!offset && q!offset + 312 <= #length[q!base])) || (p!offset + 288 <= q!offset && q!offset + 112 <= #length[q!base])) || (p!offset + 384 <= q!offset && q!offset + 16 <= #length[q!base])) || (p!offset + 116 <= q!offset && q!offset + 284 <= #length[q!base])) || (q!offset + 236 <= #length[q!base] && p!offset + 164 <= q!offset)) || (q!offset + 160 <= #length[q!base] && p!offset + 240 <= q!offset)) || (p!offset + 316 <= q!offset && q!offset + 84 <= #length[q!base])) || (p!offset + 156 <= q!offset && q!offset + 244 <= #length[q!base])) || (p!offset + 204 <= q!offset && q!offset + 196 <= #length[q!base])) || (p!offset + 376 <= q!offset && q!offset + 24 <= #length[q!base])) || (q!offset + 80 <= #length[q!base] && p!offset + 320 <= q!offset)) || (q!offset + 220 <= #length[q!base] && p!offset + 180 <= q!offset)) || (q!offset + 276 <= #length[q!base] && p!offset + 124 <= q!offset)) || (p!offset + 368 <= q!offset && q!offset + 32 <= #length[q!base])) || (q!offset + 240 <= #length[q!base] && p!offset + 160 <= q!offset)) || (q!offset + 228 <= #length[q!base] && p!offset + 172 <= q!offset)) || (q!offset + 64 <= #length[q!base] && p!offset + 336 <= q!offset)) || (p!offset + 120 <= q!offset && q!offset + 280 <= #length[q!base])) || (q!offset + 92 <= #length[q!base] && p!offset + 308 <= q!offset)) || (p!offset + 48 <= q!offset && q!offset + 352 <= #length[q!base])) || (p!offset + 96 <= q!offset && q!offset + 304 <= #length[q!base])) || (p!offset + 396 <= q!offset && q!offset + 4 <= #length[q!base])) || (q!offset + 272 <= #length[q!base] && p!offset + 128 <= q!offset)) || (p!offset + 100 <= q!offset && q!offset + 300 <= #length[q!base])) || (p!offset + 148 <= q!offset && q!offset + 252 <= #length[q!base])) || (q!offset + 164 <= #length[q!base] && p!offset + 236 <= q!offset)) || (p!offset + 16 <= q!offset && q!offset + 384 <= #length[q!base])) || (p!offset + 20 <= q!offset && q!offset + 380 <= #length[q!base])) || (p!offset + 52 <= q!offset && q!offset + 348 <= #length[q!base])) || (q!offset + 20 <= #length[q!base] && p!offset + 380 <= q!offset)) || (p!offset + 56 <= q!offset && q!offset + 344 <= #length[q!base])) || (p!offset + 328 <= q!offset && q!offset + 72 <= #length[q!base])) || (p!offset + 344 <= q!offset && q!offset + 56 <= #length[q!base])) || (q!offset + 288 <= #length[q!base] && p!offset + 112 <= q!offset)) || (q!offset + 372 <= #length[q!base] && p!offset + 28 <= q!offset)) || (p!offset + 312 <= q!offset && q!offset + 88 <= #length[q!base])) || (p!offset + 216 <= q!offset && q!offset + 184 <= #length[q!base])) || (p!offset + 136 <= q!offset && q!offset + 264 <= #length[q!base])) || (p!offset + 188 <= q!offset && q!offset + 212 <= #length[q!base])) || (q!offset + 172 <= #length[q!base] && p!offset + 228 <= q!offset)) || (p!offset + 108 <= q!offset && q!offset + 292 <= #length[q!base])) || (p!offset + 8 <= q!offset && q!offset + 392 <= #length[q!base])) || p!offset + 400 <= q!offset) || (p!offset + 296 <= q!offset && q!offset + 104 <= #length[q!base])) || (p!offset + 300 <= q!offset && q!offset + 100 <= #length[q!base])) || (p!offset + 200 <= q!offset && q!offset + 200 <= #length[q!base])) || (p!offset + 256 <= q!offset && q!offset + 144 <= #length[q!base])) || (p!offset + 192 <= q!offset && q!offset + 208 <= #length[q!base])) || (p!offset + 24 <= q!offset && q!offset + 376 <= #length[q!base])) || (p!offset + 208 <= q!offset && q!offset + 192 <= #length[q!base])) || (q!offset + 328 <= #length[q!base] && p!offset + 72 <= q!offset)) || (p!offset + 284 <= q!offset && q!offset + 116 <= #length[q!base])) || (q!offset + 180 <= #length[q!base] && p!offset + 220 <= q!offset)) || (q!offset + 60 <= #length[q!base] && p!offset + 340 <= q!offset)) || (q!offset + 8 <= #length[q!base] && p!offset + 392 <= q!offset)) || (q!offset + 260 <= #length[q!base] && p!offset + 140 <= q!offset)) || (p!offset + 388 <= q!offset && q!offset + 12 <= #length[q!base])) || (p!offset + 232 <= q!offset && q!offset + 168 <= #length[q!base])) || (q!offset + 52 <= #length[q!base] && p!offset + 348 <= q!offset)) || (q!offset + 388 <= #length[q!base] && p!offset + 12 <= q!offset)) || (p!offset + 80 <= q!offset && q!offset + 320 <= #length[q!base])) || (q!offset + 316 <= #length[q!base] && p!offset + 84 <= q!offset)) || (p!offset + 196 <= q!offset && q!offset + 204 <= #length[q!base])) || (q!offset + 156 <= #length[q!base] && p!offset + 244 <= q!offset)) || (q!offset + 188 <= #length[q!base] && p!offset + 212 <= q!offset)) || (p!offset + 40 <= q!offset && q!offset + 360 <= #length[q!base])) || (p!offset + 248 <= q!offset && q!offset + 152 <= #length[q!base])) || (p!offset + 64 <= q!offset && q!offset + 336 <= #length[q!base])) || (q!offset + 224 <= #length[q!base] && p!offset + 176 <= q!offset)) || (p!offset + 36 <= q!offset && q!offset + 364 <= #length[q!base])) || (p!offset + 132 <= q!offset && q!offset + 268 <= #length[q!base])) || (q!offset + 140 <= #length[q!base] && p!offset + 260 <= q!offset)) || (p!offset + 76 <= q!offset && q!offset + 324 <= #length[q!base])) || (p!offset + 276 <= q!offset && q!offset + 124 <= #length[q!base])) || (q!offset + 76 <= #length[q!base] && p!offset + 324 <= q!offset)) || (p!offset + 304 <= q!offset && q!offset + 96 <= #length[q!base])) || (q!offset + 248 <= #length[q!base] && p!offset + 152 <= q!offset)) || (p!offset + 280 <= q!offset && q!offset + 120 <= #length[q!base])) || (q!offset + 308 <= #length[q!base] && p!offset + 92 <= q!offset)) || (p!offset + 268 <= q!offset && q!offset + 132 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 == #length[q!base])) || (p!offset + 356 <= q!offset && q!offset + 44 <= #length[q!base])) || (p!offset + 272 <= q!offset && q!offset + 128 <= #length[q!base])) || (q!offset + 216 <= #length[q!base] && p!offset + 184 <= q!offset)) || (p!offset + 68 <= q!offset && q!offset + 332 <= #length[q!base])) || (q!offset + 176 <= #length[q!base] && p!offset + 224 <= q!offset)) || (q!offset + 40 <= #length[q!base] && p!offset + 360 <= q!offset)) || (q!offset + 136 <= #length[q!base] && p!offset + 264 <= q!offset)) || (q!offset + 28 <= #length[q!base] && p!offset + 372 <= q!offset)) || (q!offset + 68 <= #length[q!base] && p!offset + 332 <= q!offset)) || ((q!offset <= 4 && 400 == #length[q!base]) && p!offset + 4 <= q!offset)) || (q!offset + 256 <= #length[q!base] && p!offset + 144 <= q!offset)) || (p!offset + 104 <= q!offset && q!offset + 296 <= #length[q!base]) - ProcedureContractResult [Line: 3]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 50.0s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 3 SDslu, 5244 SDs, 0 SdLazy, 14575 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=100, 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.8s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 313 NumberOfFragments, 3920 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 15554 NumberOfCodeBlocks, 15554 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 15453 ConstructedInterpolants, 0 QuantifiedInterpolants, 21952938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 15050/515100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-34-18-785.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-34-18-785.csv Received shutdown request...