java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/StepwiseAddition.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:22,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:22,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:22,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:22,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:22,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:22,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:22,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:22,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:22,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:22,850 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:22,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:22,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:22,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:22,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:22,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:22,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:22,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:22,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:22,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:22,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:22,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:22,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:22,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:22,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:22,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:22,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:22,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:22,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:22,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:22,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:22,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:22,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:22,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:22,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:22,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:22,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:22,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:22,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:22,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:22,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:22,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:22,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:22,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:22,964 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:22,964 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:22,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/StepwiseAddition.bpl [2019-08-05 10:43:22,965 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/StepwiseAddition.bpl' [2019-08-05 10:43:23,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:23,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:23,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:23,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:23,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:23,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,040 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:23,040 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:23,040 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:23,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:23,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:23,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:23,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:23,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... [2019-08-05 10:43:23,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:23,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:23,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:23,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:23,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:43:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure StepwiseAddition [2019-08-05 10:43:23,142 INFO L138 BoogieDeclarations]: Found implementation of procedure StepwiseAddition [2019-08-05 10:43:23,197 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:43:23,304 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:23,304 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:43:23,305 INFO L202 PluginConnector]: Adding new model StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:23 BoogieIcfgContainer [2019-08-05 10:43:23,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:23,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:23,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:23,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:23,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:22" (1/2) ... [2019-08-05 10:43:23,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0e7e07 and model type StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:23, skipping insertion in model container [2019-08-05 10:43:23,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:23" (2/2) ... [2019-08-05 10:43:23,314 INFO L109 eAbstractionObserver]: Analyzing ICFG StepwiseAddition.bpl [2019-08-05 10:43:23,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:23,331 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:23,347 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:23,373 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:23,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:23,374 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:23,374 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:23,374 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:23,374 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:23,375 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:23,375 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:23,375 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:43:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:23,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:23,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:23,400 INFO L418 AbstractCegarLoop]: === Iteration 1 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1407322, now seen corresponding path program 1 times [2019-08-05 10:43:23,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:23,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:23,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:23,670 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:43:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:43:23,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:23,857 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 5 states. [2019-08-05 10:43:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:24,112 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 10:43:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:24,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:24,124 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:24,124 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:24,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-08-05 10:43:24,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-08-05 10:43:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:24,157 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-08-05 10:43:24,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-08-05 10:43:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:24,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:24,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:43:24,159 INFO L418 AbstractCegarLoop]: === Iteration 2 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash 43561587, now seen corresponding path program 1 times [2019-08-05 10:43:24,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:24,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:24,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:24,321 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:43:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:24,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:24,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:24,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:24,538 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 6 states. [2019-08-05 10:43:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:24,871 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 10:43:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:24,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:24,876 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:24,876 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:24,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 10:43:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-08-05 10:43:24,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-08-05 10:43:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:24,881 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-08-05 10:43:24,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-08-05 10:43:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:24,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:24,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:43:24,883 INFO L418 AbstractCegarLoop]: === Iteration 3 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 43625013, now seen corresponding path program 1 times [2019-08-05 10:43:24,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:24,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:24,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:25,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:25,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:25,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:25,100 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2019-08-05 10:43:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:25,255 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-08-05 10:43:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:25,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:25,257 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:25,257 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:43:25,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:43:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:43:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-08-05 10:43:25,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 5 [2019-08-05 10:43:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:25,260 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-08-05 10:43:25,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-08-05 10:43:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:25,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,262 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:43:25,262 INFO L418 AbstractCegarLoop]: === Iteration 4 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:25,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1350343802, now seen corresponding path program 2 times [2019-08-05 10:43:25,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,274 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,464 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:43:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:25,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:25,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:25,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:25,658 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 7 states. [2019-08-05 10:43:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:25,841 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 10:43:25,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:25,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:25,843 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:25,843 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:25,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 10:43:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 10:43:25,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2019-08-05 10:43:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:25,847 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 10:43:25,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 10:43:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:25,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:43:25,848 INFO L418 AbstractCegarLoop]: === Iteration 5 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1350407228, now seen corresponding path program 1 times [2019-08-05 10:43:25,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:25,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:25,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:25,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:25,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:25,985 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2019-08-05 10:43:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,083 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 10:43:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:26,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,086 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:26,086 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:26,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 10:43:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 10:43:26,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2019-08-05 10:43:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,090 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 10:43:26,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 10:43:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:26,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,090 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:43:26,091 INFO L418 AbstractCegarLoop]: === Iteration 6 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1352373434, now seen corresponding path program 2 times [2019-08-05 10:43:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:26,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:26,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:26,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:26,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:26,232 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2019-08-05 10:43:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,327 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2019-08-05 10:43:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:26,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,332 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:26,332 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:26,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 10:43:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 10:43:26,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2019-08-05 10:43:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,336 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 10:43:26,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 10:43:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:26,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,337 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:43:26,337 INFO L418 AbstractCegarLoop]: === Iteration 7 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1089080493, now seen corresponding path program 3 times [2019-08-05 10:43:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:26,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:26,609 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 8 states. [2019-08-05 10:43:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,755 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-08-05 10:43:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:26,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,760 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:26,761 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:26,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:43:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-08-05 10:43:26,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 7 [2019-08-05 10:43:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,765 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-08-05 10:43:26,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-08-05 10:43:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:26,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,765 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:43:26,766 INFO L418 AbstractCegarLoop]: === Iteration 8 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1089017067, now seen corresponding path program 2 times [2019-08-05 10:43:26,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:26,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:26,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:26,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:26,923 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 8 states. [2019-08-05 10:43:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,040 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-08-05 10:43:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:27,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,041 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:27,042 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:27,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:43:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-08-05 10:43:27,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 7 [2019-08-05 10:43:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,047 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-08-05 10:43:27,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-08-05 10:43:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:27,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,048 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:43:27,048 INFO L418 AbstractCegarLoop]: === Iteration 9 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1087050861, now seen corresponding path program 3 times [2019-08-05 10:43:27,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:27,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:27,183 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 8 states. [2019-08-05 10:43:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,271 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-08-05 10:43:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:27,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,273 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:27,273 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:27,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:43:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-08-05 10:43:27,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 7 [2019-08-05 10:43:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,277 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-08-05 10:43:27,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-08-05 10:43:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:27,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,278 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:43:27,278 INFO L418 AbstractCegarLoop]: === Iteration 10 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1026098475, now seen corresponding path program 3 times [2019-08-05 10:43:27,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,290 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:27,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:27,461 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 8 states. [2019-08-05 10:43:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,554 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:43:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:27,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,555 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:27,555 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:43:27,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:43:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2019-08-05 10:43:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-08-05 10:43:27,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2019-08-05 10:43:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,559 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-08-05 10:43:27,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2019-08-05 10:43:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:27,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,560 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 10:43:27,560 INFO L418 AbstractCegarLoop]: === Iteration 11 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash 598177690, now seen corresponding path program 4 times [2019-08-05 10:43:27,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,572 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:27,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:27,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:27,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:27,814 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 9 states. [2019-08-05 10:43:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,999 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 10:43:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:27,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,000 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:28,000 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:28,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:43:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-08-05 10:43:28,004 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2019-08-05 10:43:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-08-05 10:43:28,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2019-08-05 10:43:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:28,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,005 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:43:28,005 INFO L418 AbstractCegarLoop]: === Iteration 12 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash 598241116, now seen corresponding path program 4 times [2019-08-05 10:43:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,024 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:28,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:28,239 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2019-08-05 10:43:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,389 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 10:43:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:28,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,390 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:28,390 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:28,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:43:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-08-05 10:43:28,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2019-08-05 10:43:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,395 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-08-05 10:43:28,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2019-08-05 10:43:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:28,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,396 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:43:28,396 INFO L418 AbstractCegarLoop]: === Iteration 13 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash 600207322, now seen corresponding path program 5 times [2019-08-05 10:43:28,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:28,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:28,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:28,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:28,502 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2019-08-05 10:43:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,619 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 10:43:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:28,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,620 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:28,621 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:28,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:43:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-08-05 10:43:28,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2019-08-05 10:43:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,625 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-08-05 10:43:28,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2019-08-05 10:43:28,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:28,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,626 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:43:28,626 INFO L418 AbstractCegarLoop]: === Iteration 14 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash 661159708, now seen corresponding path program 6 times [2019-08-05 10:43:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:28,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:28,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:28,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:28,764 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2019-08-05 10:43:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,936 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 10:43:28,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:28,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,937 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:28,937 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:28,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:43:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-08-05 10:43:28,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2019-08-05 10:43:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,942 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-08-05 10:43:28,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2019-08-05 10:43:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:28,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,943 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 10:43:28,943 INFO L418 AbstractCegarLoop]: === Iteration 15 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1744283622, now seen corresponding path program 4 times [2019-08-05 10:43:28,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:29,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:29,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:29,119 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2019-08-05 10:43:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,320 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 10:43:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:29,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,322 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:43:29,322 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:43:29,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:43:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-05 10:43:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-08-05 10:43:29,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 8 [2019-08-05 10:43:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,326 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-08-05 10:43:29,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2019-08-05 10:43:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:29,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,327 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 10:43:29,327 INFO L418 AbstractCegarLoop]: === Iteration 16 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1363573811, now seen corresponding path program 5 times [2019-08-05 10:43:29,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:29,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:29,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:29,521 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 10 states. [2019-08-05 10:43:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,821 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:43:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:29,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,823 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:29,823 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:29,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:43:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:43:29,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 9 [2019-08-05 10:43:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,827 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:43:29,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:43:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:29,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,828 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:43:29,829 INFO L418 AbstractCegarLoop]: === Iteration 17 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:29,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1363637237, now seen corresponding path program 7 times [2019-08-05 10:43:29,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:30,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:30,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:30,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:30,106 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2019-08-05 10:43:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:30,524 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:43:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:30,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:30,525 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:30,525 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:30,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:43:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:43:30,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 9 [2019-08-05 10:43:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:30,529 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:43:30,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:43:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:30,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,530 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-08-05 10:43:30,530 INFO L418 AbstractCegarLoop]: === Iteration 18 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1365603443, now seen corresponding path program 8 times [2019-08-05 10:43:30,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:30,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:30,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:30,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:30,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:30,723 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2019-08-05 10:43:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:30,909 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:43:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:30,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:30,910 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:30,910 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:30,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:43:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:43:30,914 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 9 [2019-08-05 10:43:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:30,914 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:43:30,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:43:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:30,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,915 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-08-05 10:43:30,915 INFO L418 AbstractCegarLoop]: === Iteration 19 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1426555829, now seen corresponding path program 9 times [2019-08-05 10:43:30,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:31,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:31,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:31,065 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2019-08-05 10:43:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,202 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:43:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:31,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,210 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:31,210 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:31,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:43:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:43:31,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 9 [2019-08-05 10:43:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,213 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:43:31,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:43:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:31,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,214 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:43:31,214 INFO L418 AbstractCegarLoop]: === Iteration 20 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash -978887501, now seen corresponding path program 10 times [2019-08-05 10:43:31,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:31,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:31,388 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2019-08-05 10:43:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,496 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:43:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:31,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,500 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:31,500 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:31,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:43:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:43:31,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 9 [2019-08-05 10:43:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,503 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:43:31,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:43:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:31,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,504 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 10:43:31,504 INFO L418 AbstractCegarLoop]: === Iteration 21 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1761780597, now seen corresponding path program 5 times [2019-08-05 10:43:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:31,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:31,660 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2019-08-05 10:43:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,788 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-08-05 10:43:31,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:31,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,789 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:43:31,790 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:43:31,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:43:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 10:43:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:43:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-08-05 10:43:31,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 9 [2019-08-05 10:43:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,793 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-08-05 10:43:31,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2019-08-05 10:43:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:31,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,794 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 10:43:31,795 INFO L418 AbstractCegarLoop]: === Iteration 22 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,795 INFO L82 PathProgramCache]: Analyzing trace with hash -678950214, now seen corresponding path program 6 times [2019-08-05 10:43:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,805 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:31,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:31,959 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 11 states. [2019-08-05 10:43:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,258 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-08-05 10:43:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:32,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,261 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:32,261 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:32,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:43:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:43:32,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:43:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,263 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:43:32,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:43:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:32,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,264 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:43:32,264 INFO L418 AbstractCegarLoop]: === Iteration 23 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash -678886788, now seen corresponding path program 11 times [2019-08-05 10:43:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,272 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:32,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:32,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:32,394 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:43:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,611 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-08-05 10:43:32,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:32,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,612 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:32,612 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:32,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:43:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:43:32,616 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:43:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,617 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:43:32,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:43:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:32,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,617 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1] [2019-08-05 10:43:32,618 INFO L418 AbstractCegarLoop]: === Iteration 24 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash -676920582, now seen corresponding path program 12 times [2019-08-05 10:43:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:32,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:32,752 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:43:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,974 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-08-05 10:43:32,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:32,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,975 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:32,975 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:32,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:43:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:43:32,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:43:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,979 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:43:32,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:43:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:32,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,979 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 10:43:32,980 INFO L418 AbstractCegarLoop]: === Iteration 25 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash -615968196, now seen corresponding path program 13 times [2019-08-05 10:43:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:33,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:33,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:33,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:33,261 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:43:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:33,466 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-08-05 10:43:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:33,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:33,468 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:33,468 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:33,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:43:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:43:33,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:43:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:33,471 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:43:33,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:43:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:33,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:33,472 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1] [2019-08-05 10:43:33,472 INFO L418 AbstractCegarLoop]: === Iteration 26 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1273555770, now seen corresponding path program 14 times [2019-08-05 10:43:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:33,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:33,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:33,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:33,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:33,607 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:43:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:33,762 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-08-05 10:43:33,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:33,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:33,763 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:33,764 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:33,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:43:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:43:33,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:43:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:33,767 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:43:33,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:43:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:33,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:33,768 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:43:33,769 INFO L418 AbstractCegarLoop]: === Iteration 27 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:33,769 INFO L82 PathProgramCache]: Analyzing trace with hash -280743428, now seen corresponding path program 15 times [2019-08-05 10:43:33,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:33,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:33,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:33,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:33,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:33,930 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:43:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,083 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-08-05 10:43:34,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:34,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,084 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:34,084 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:34,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:43:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:43:34,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:43:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,087 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:43:34,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:43:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:34,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,088 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 10:43:34,088 INFO L418 AbstractCegarLoop]: === Iteration 28 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1219378310, now seen corresponding path program 6 times [2019-08-05 10:43:34,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,289 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:43:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:34,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:34,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:34,412 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:43:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,534 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-08-05 10:43:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:34,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,535 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:43:34,535 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:43:34,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:43:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-08-05 10:43:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:43:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-08-05 10:43:34,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 10 [2019-08-05 10:43:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,539 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-08-05 10:43:34,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2019-08-05 10:43:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:34,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,539 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 10:43:34,540 INFO L418 AbstractCegarLoop]: === Iteration 29 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash 427314451, now seen corresponding path program 7 times [2019-08-05 10:43:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,546 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:34,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:34,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:34,691 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 12 states. [2019-08-05 10:43:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,980 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:34,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,981 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:34,981 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:34,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:34,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,985 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:34,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:34,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,986 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:43:34,986 INFO L418 AbstractCegarLoop]: === Iteration 30 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 427377877, now seen corresponding path program 16 times [2019-08-05 10:43:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:35,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:35,144 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,684 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:35,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:35,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,685 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:35,685 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:35,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:35,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,688 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:35,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:35,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,689 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1] [2019-08-05 10:43:35,689 INFO L418 AbstractCegarLoop]: === Iteration 31 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:35,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash 429344083, now seen corresponding path program 17 times [2019-08-05 10:43:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:35,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:35,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:35,836 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,095 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:36,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:36,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,096 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:36,096 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:36,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:36,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,100 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:36,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:36,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,101 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-08-05 10:43:36,101 INFO L418 AbstractCegarLoop]: === Iteration 32 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:36,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,102 INFO L82 PathProgramCache]: Analyzing trace with hash 490296469, now seen corresponding path program 18 times [2019-08-05 10:43:36,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:36,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:36,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:36,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:36,236 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,434 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:36,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,436 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:36,436 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:36,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:36,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,439 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:36,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:36,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,440 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-08-05 10:43:36,440 INFO L418 AbstractCegarLoop]: === Iteration 33 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1915146861, now seen corresponding path program 19 times [2019-08-05 10:43:36,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:36,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:36,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:36,584 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,118 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:37,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,119 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:37,120 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:37,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:37,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,123 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:37,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:37,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,124 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1] [2019-08-05 10:43:37,124 INFO L418 AbstractCegarLoop]: === Iteration 34 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:37,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash 825521237, now seen corresponding path program 20 times [2019-08-05 10:43:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:37,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:37,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:37,270 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,432 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:37,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:37,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,433 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:37,434 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:37,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:37,437 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,438 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:37,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:37,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,439 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:43:37,439 INFO L418 AbstractCegarLoop]: === Iteration 35 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:37,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,439 INFO L82 PathProgramCache]: Analyzing trace with hash -113113645, now seen corresponding path program 21 times [2019-08-05 10:43:37,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:37,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:37,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:37,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:37,621 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,787 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-08-05 10:43:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:37,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,788 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:37,788 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:37,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:43:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:43:37,791 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:43:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,791 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:43:37,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:43:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:37,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,792 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 10:43:37,793 INFO L418 AbstractCegarLoop]: === Iteration 36 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 853976085, now seen corresponding path program 7 times [2019-08-05 10:43:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:38,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:38,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:38,040 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:43:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:38,173 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-08-05 10:43:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:38,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:38,174 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:43:38,175 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:43:38,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:43:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-08-05 10:43:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:43:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-08-05 10:43:38,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 11 [2019-08-05 10:43:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:38,178 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-08-05 10:43:38,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2019-08-05 10:43:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:38,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:38,179 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 10:43:38,179 INFO L418 AbstractCegarLoop]: === Iteration 37 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash 361780698, now seen corresponding path program 8 times [2019-08-05 10:43:38,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:38,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:43:38,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:38,324 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:43:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:38,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:38,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:38,618 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 13 states. [2019-08-05 10:43:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:38,991 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:38,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:38,992 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:38,992 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:38,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:38,995 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:38,995 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:38,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:38,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:38,996 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:43:38,996 INFO L418 AbstractCegarLoop]: === Iteration 38 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 361844124, now seen corresponding path program 22 times [2019-08-05 10:43:38,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:39,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:39,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:39,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:39,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:39,156 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,468 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:39,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,469 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:39,469 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:39,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:39,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,472 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:39,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:39,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,472 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1] [2019-08-05 10:43:39,473 INFO L418 AbstractCegarLoop]: === Iteration 39 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,473 INFO L82 PathProgramCache]: Analyzing trace with hash 363810330, now seen corresponding path program 23 times [2019-08-05 10:43:39,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:39,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:39,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:39,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:39,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:39,691 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,958 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:39,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:39,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,959 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:39,960 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:39,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:39,962 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,963 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:39,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:39,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,963 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1] [2019-08-05 10:43:39,964 INFO L418 AbstractCegarLoop]: === Iteration 40 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,964 INFO L82 PathProgramCache]: Analyzing trace with hash 424762716, now seen corresponding path program 24 times [2019-08-05 10:43:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:40,247 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:43:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:40,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:40,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:40,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:40,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:40,395 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,621 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:40,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:40,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,622 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:40,622 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:40,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:40,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,626 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:40,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:40,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,627 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 10:43:40,627 INFO L418 AbstractCegarLoop]: === Iteration 41 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1980680614, now seen corresponding path program 25 times [2019-08-05 10:43:40,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:40,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:40,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:40,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:40,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:40,759 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,977 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:40,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:40,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,978 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:40,979 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:40,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:40,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,981 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:40,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:40,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,982 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1] [2019-08-05 10:43:40,982 INFO L418 AbstractCegarLoop]: === Iteration 42 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,982 INFO L82 PathProgramCache]: Analyzing trace with hash 759987484, now seen corresponding path program 26 times [2019-08-05 10:43:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:41,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:41,118 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:41,309 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:41,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:41,310 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:41,310 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:41,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:41,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:41,313 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:41,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:41,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:41,313 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1] [2019-08-05 10:43:41,314 INFO L418 AbstractCegarLoop]: === Iteration 43 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:41,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash -178647398, now seen corresponding path program 27 times [2019-08-05 10:43:41,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:41,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:41,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:41,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:41,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:41,671 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:41,844 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:41,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:41,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:41,845 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:41,845 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:41,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:41,849 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:41,849 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:41,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:41,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:41,849 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:43:41,849 INFO L418 AbstractCegarLoop]: === Iteration 44 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash 788442332, now seen corresponding path program 28 times [2019-08-05 10:43:41,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:41,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:41,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:41,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:41,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:41,983 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:42,140 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-08-05 10:43:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:42,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:42,141 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:42,142 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:42,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:43:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:43:42,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:43:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:42,144 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:43:42,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:43:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:42,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:42,145 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 10:43:42,145 INFO L418 AbstractCegarLoop]: === Iteration 45 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 703452890, now seen corresponding path program 8 times [2019-08-05 10:43:42,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:42,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:43:42,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:42,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:42,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:42,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:42,326 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:43:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:42,483 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2019-08-05 10:43:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:42,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:42,485 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:43:42,485 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:43:42,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:43:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-08-05 10:43:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:43:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-08-05 10:43:42,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 12 [2019-08-05 10:43:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:42,488 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-08-05 10:43:42,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2019-08-05 10:43:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:42,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:42,488 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 10:43:42,488 INFO L418 AbstractCegarLoop]: === Iteration 46 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1669765645, now seen corresponding path program 9 times [2019-08-05 10:43:42,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:42,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:43:42,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:42,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:42,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:42,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:42,718 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 14 states. [2019-08-05 10:43:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:43,118 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:43,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:43,119 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:43,120 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:43,120 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:43,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:43,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:43,123 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:43,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:43,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:43,124 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:43:43,124 INFO L418 AbstractCegarLoop]: === Iteration 47 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1669702219, now seen corresponding path program 29 times [2019-08-05 10:43:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:43,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:43,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:43,408 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:43:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:44,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:44,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:44,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:44,102 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,430 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:44,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,431 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:44,431 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:44,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:44,433 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,434 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:44,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:44,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,434 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1] [2019-08-05 10:43:44,435 INFO L418 AbstractCegarLoop]: === Iteration 48 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1667736013, now seen corresponding path program 30 times [2019-08-05 10:43:44,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:44,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:44,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:44,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:44,591 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,903 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:44,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,904 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:44,904 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:44,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:44,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,907 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:44,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:44,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,908 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1] [2019-08-05 10:43:44,908 INFO L418 AbstractCegarLoop]: === Iteration 49 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1606783627, now seen corresponding path program 31 times [2019-08-05 10:43:44,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,914 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:46,233 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:43:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:46,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:46,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:46,582 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:46,874 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:46,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:46,876 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:46,876 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:46,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:46,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:46,879 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:46,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:46,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:46,879 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2019-08-05 10:43:46,880 INFO L418 AbstractCegarLoop]: === Iteration 50 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:46,880 INFO L82 PathProgramCache]: Analyzing trace with hash 282740339, now seen corresponding path program 32 times [2019-08-05 10:43:46,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:46,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:46,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:47,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:47,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:47,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:47,143 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,415 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:47,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:47,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,416 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:47,416 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:47,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:47,419 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,419 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:47,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:47,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,420 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2019-08-05 10:43:47,420 INFO L418 AbstractCegarLoop]: === Iteration 51 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1271558859, now seen corresponding path program 33 times [2019-08-05 10:43:47,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:47,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:47,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:47,618 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,863 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:47,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,865 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:47,865 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:47,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:47,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,867 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:47,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:47,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,868 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1] [2019-08-05 10:43:47,868 INFO L418 AbstractCegarLoop]: === Iteration 52 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2084773555, now seen corresponding path program 34 times [2019-08-05 10:43:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:48,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:48,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:48,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:48,013 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:48,231 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:48,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:48,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:48,232 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:48,233 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:48,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:48,235 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:48,235 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:48,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:48,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:48,236 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1] [2019-08-05 10:43:48,236 INFO L418 AbstractCegarLoop]: === Iteration 53 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1243104011, now seen corresponding path program 35 times [2019-08-05 10:43:48,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:48,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:48,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:48,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:48,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:48,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:48,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:48,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:48,432 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:48,778 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:48,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:48,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:48,779 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:48,779 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:48,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:48,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:48,781 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:48,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:48,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:48,781 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:43:48,781 INFO L418 AbstractCegarLoop]: === Iteration 54 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1328093453, now seen corresponding path program 36 times [2019-08-05 10:43:48,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:48,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:48,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:48,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:48,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:48,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:48,981 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:49,161 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-08-05 10:43:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:49,162 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:49,163 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:49,163 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:49,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:43:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:43:49,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:43:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:49,166 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:43:49,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:43:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:49,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:49,167 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 10:43:49,167 INFO L418 AbstractCegarLoop]: === Iteration 55 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash 332201141, now seen corresponding path program 9 times [2019-08-05 10:43:49,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:49,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:43:49,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:49,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:49,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:49,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:49,480 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:43:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:49,646 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-08-05 10:43:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:49,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:49,647 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:43:49,647 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:43:49,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:43:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-08-05 10:43:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:43:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-08-05 10:43:49,649 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 13 [2019-08-05 10:43:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:49,650 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-08-05 10:43:49,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2019-08-05 10:43:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:49,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:49,650 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 10:43:49,651 INFO L418 AbstractCegarLoop]: === Iteration 56 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash -223192838, now seen corresponding path program 10 times [2019-08-05 10:43:49,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:49,656 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:43:49,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:49,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:49,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:49,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:49,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:49,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:49,849 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 15 states. [2019-08-05 10:43:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,278 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:50,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:50,279 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:50,279 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:50,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:50,281 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:50,281 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:50,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:50,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,282 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:43:50,282 INFO L418 AbstractCegarLoop]: === Iteration 57 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,283 INFO L82 PathProgramCache]: Analyzing trace with hash -223129412, now seen corresponding path program 37 times [2019-08-05 10:43:50,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,288 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:50,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:50,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:50,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:50,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:50,534 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,919 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:50,920 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:50,920 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:50,921 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:50,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:50,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:50,924 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:50,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:50,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,925 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1] [2019-08-05 10:43:50,925 INFO L418 AbstractCegarLoop]: === Iteration 58 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash -221163206, now seen corresponding path program 38 times [2019-08-05 10:43:50,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:51,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:51,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:51,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:51,443 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:51,807 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:51,808 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,808 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:51,808 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:51,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:51,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,812 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:51,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:51,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,813 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1] [2019-08-05 10:43:51,813 INFO L418 AbstractCegarLoop]: === Iteration 59 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -160210820, now seen corresponding path program 39 times [2019-08-05 10:43:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,819 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:52,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:52,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:52,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:52,005 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:52,384 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:52,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:52,385 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:52,386 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:52,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:52,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:52,388 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:52,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:52,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:52,389 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1] [2019-08-05 10:43:52,389 INFO L418 AbstractCegarLoop]: === Iteration 60 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1729313146, now seen corresponding path program 40 times [2019-08-05 10:43:52,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:52,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:52,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:52,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:52,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:52,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:52,779 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:53,109 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:53,109 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:53,110 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:53,110 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:53,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:53,112 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:53,112 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:53,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:53,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:53,113 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 10:43:53,113 INFO L418 AbstractCegarLoop]: === Iteration 61 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 175013948, now seen corresponding path program 41 times [2019-08-05 10:43:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:53,119 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:53,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:53,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:53,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:53,369 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:53,740 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:53,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:53,741 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:53,741 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:53,741 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:53,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:53,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:53,743 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:53,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:53,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:53,744 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1] [2019-08-05 10:43:53,745 INFO L418 AbstractCegarLoop]: === Iteration 62 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash -763620934, now seen corresponding path program 42 times [2019-08-05 10:43:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:53,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:53,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:54,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:54,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:54,119 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:54,399 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:54,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:54,400 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:54,400 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:54,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:54,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:54,403 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:54,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:54,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:54,404 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1] [2019-08-05 10:43:54,404 INFO L418 AbstractCegarLoop]: === Iteration 63 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash 203468796, now seen corresponding path program 43 times [2019-08-05 10:43:54,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:54,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:54,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:54,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:54,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:54,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:54,571 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:54,828 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:54,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:54,829 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:54,829 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:54,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:54,832 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:54,832 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:54,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:54,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:54,833 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1] [2019-08-05 10:43:54,833 INFO L418 AbstractCegarLoop]: === Iteration 64 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:54,834 INFO L82 PathProgramCache]: Analyzing trace with hash 118479354, now seen corresponding path program 44 times [2019-08-05 10:43:54,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:54,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:54,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:55,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:55,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:55,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:55,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:55,316 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:55,536 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:55,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:55,538 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:55,538 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:55,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:55,540 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:55,541 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:55,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:55,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,541 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:43:55,542 INFO L418 AbstractCegarLoop]: === Iteration 65 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1778773948, now seen corresponding path program 45 times [2019-08-05 10:43:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,803 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:43:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:56,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:56,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:56,051 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,263 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-08-05 10:43:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:56,263 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,264 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:56,264 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:56,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:43:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:43:56,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:43:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,266 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:43:56,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:43:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:56,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,267 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 10:43:56,268 INFO L418 AbstractCegarLoop]: === Iteration 66 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1708298810, now seen corresponding path program 10 times [2019-08-05 10:43:56,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,430 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:43:56,709 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:43:57,042 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:43:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:57,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:57,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:57,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:57,096 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:43:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,291 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2019-08-05 10:43:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:57,292 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,293 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:43:57,293 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:43:57,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:43:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-08-05 10:43:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:43:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-08-05 10:43:57,295 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 14 [2019-08-05 10:43:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,295 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-08-05 10:43:57,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-08-05 10:43:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:57,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,296 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 10:43:57,296 INFO L418 AbstractCegarLoop]: === Iteration 67 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1670891219, now seen corresponding path program 11 times [2019-08-05 10:43:57,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:57,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:57,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:57,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:57,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:57,498 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 16 states. [2019-08-05 10:43:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,966 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:43:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:43:57,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:43:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,967 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:43:57,967 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:43:57,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:43:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:43:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:43:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:43:57,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:43:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,969 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:43:57,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:43:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:43:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:57,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,970 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:43:57,970 INFO L418 AbstractCegarLoop]: === Iteration 68 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1670954645, now seen corresponding path program 46 times [2019-08-05 10:43:57,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:58,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:58,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:58,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:58,139 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:43:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,589 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:43:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:43:58,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:43:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,590 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:43:58,590 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:43:58,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:43:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:43:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:43:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:43:58,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:43:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,592 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:43:58,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:43:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:43:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:58,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,593 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1] [2019-08-05 10:43:58,593 INFO L418 AbstractCegarLoop]: === Iteration 69 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:58,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1672920851, now seen corresponding path program 47 times [2019-08-05 10:43:58,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:58,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:43:58,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:59,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:59,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:59,112 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:43:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:59,514 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:43:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:43:59,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:43:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:59,515 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:43:59,516 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:43:59,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:43:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:43:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:43:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:43:59,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:43:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:59,518 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:43:59,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:43:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:43:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:59,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:59,519 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1] [2019-08-05 10:43:59,519 INFO L418 AbstractCegarLoop]: === Iteration 70 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:43:59,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1733873237, now seen corresponding path program 48 times [2019-08-05 10:43:59,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:59,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:43:59,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:59,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:59,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:59,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:59,793 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,169 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:00,169 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,170 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:00,170 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:00,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:00,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,172 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:00,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:00,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,173 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1] [2019-08-05 10:44:00,173 INFO L418 AbstractCegarLoop]: === Iteration 71 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -671570093, now seen corresponding path program 49 times [2019-08-05 10:44:00,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:00,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:00,399 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,752 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:00,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:00,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,753 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:00,753 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:00,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:00,755 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,755 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:00,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:00,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,756 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-08-05 10:44:00,756 INFO L418 AbstractCegarLoop]: === Iteration 72 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2069098005, now seen corresponding path program 50 times [2019-08-05 10:44:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:00,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:00,937 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,270 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:01,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,271 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:01,271 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:01,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:01,274 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,274 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:01,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:01,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,275 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-08-05 10:44:01,275 INFO L418 AbstractCegarLoop]: === Iteration 73 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1130463123, now seen corresponding path program 51 times [2019-08-05 10:44:01,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:01,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:01,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:01,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:01,469 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,781 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:01,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:01,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,782 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:01,782 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:01,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:01,784 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,785 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:01,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:01,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,786 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1] [2019-08-05 10:44:01,786 INFO L418 AbstractCegarLoop]: === Iteration 74 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2097552853, now seen corresponding path program 52 times [2019-08-05 10:44:01,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:01,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:01,982 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,271 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:02,272 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,273 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:02,273 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:02,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:02,275 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,275 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:02,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:02,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,276 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1] [2019-08-05 10:44:02,276 INFO L418 AbstractCegarLoop]: === Iteration 75 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2012563411, now seen corresponding path program 53 times [2019-08-05 10:44:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:02,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:02,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:02,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:02,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:02,476 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,756 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:02,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:02,757 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,757 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:02,757 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:02,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:02,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,760 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:02,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:02,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,761 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1] [2019-08-05 10:44:02,761 INFO L418 AbstractCegarLoop]: === Iteration 76 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash -622109291, now seen corresponding path program 54 times [2019-08-05 10:44:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:03,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:03,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:03,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:03,073 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,322 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:03,323 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:03,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,324 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:03,324 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:03,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:03,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,326 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:03,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:03,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,327 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:44:03,327 INFO L418 AbstractCegarLoop]: === Iteration 77 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash -692584429, now seen corresponding path program 55 times [2019-08-05 10:44:03,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:03,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:03,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:03,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:03,509 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,734 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2019-08-05 10:44:03,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:03,735 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,736 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:03,736 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:03,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:44:03,738 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:44:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,738 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:44:03,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:44:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:03,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,738 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 10:44:03,739 INFO L418 AbstractCegarLoop]: === Iteration 78 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1417653589, now seen corresponding path program 11 times [2019-08-05 10:44:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:04,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:04,237 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:44:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,458 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-08-05 10:44:04,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:04,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:44:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,459 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:04,459 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:44:04,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:44:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2019-08-05 10:44:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:44:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-08-05 10:44:04,462 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 15 [2019-08-05 10:44:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,462 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-08-05 10:44:04,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2019-08-05 10:44:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:04,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,463 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 10:44:04,463 INFO L418 AbstractCegarLoop]: === Iteration 79 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash 257954842, now seen corresponding path program 12 times [2019-08-05 10:44:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:04,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:04,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:04,689 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 17 states. [2019-08-05 10:44:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,223 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:05,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:05,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,225 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:05,225 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:05,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:05,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,227 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:05,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:05,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,228 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:44:05,228 INFO L418 AbstractCegarLoop]: === Iteration 80 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 258018268, now seen corresponding path program 56 times [2019-08-05 10:44:05,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:05,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:05,434 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,921 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:05,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,922 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:05,922 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:05,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:05,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,924 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:05,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:05,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,925 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1] [2019-08-05 10:44:05,925 INFO L418 AbstractCegarLoop]: === Iteration 81 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash 259984474, now seen corresponding path program 57 times [2019-08-05 10:44:05,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:06,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:06,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:06,148 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,607 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:06,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:06,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,608 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:06,608 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:06,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:06,610 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,611 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:06,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:06,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,612 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1] [2019-08-05 10:44:06,612 INFO L418 AbstractCegarLoop]: === Iteration 82 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,612 INFO L82 PathProgramCache]: Analyzing trace with hash 320936860, now seen corresponding path program 58 times [2019-08-05 10:44:06,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:06,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:06,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:06,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:06,817 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,260 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:07,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:07,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,262 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:07,262 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:07,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:07,264 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,264 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:07,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:07,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,265 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1] [2019-08-05 10:44:07,266 INFO L418 AbstractCegarLoop]: === Iteration 83 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2084506470, now seen corresponding path program 59 times [2019-08-05 10:44:07,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:07,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:07,516 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,931 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:07,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,932 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:07,932 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:07,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:07,934 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,935 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:07,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:07,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,935 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1] [2019-08-05 10:44:07,936 INFO L418 AbstractCegarLoop]: === Iteration 84 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:07,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,936 INFO L82 PathProgramCache]: Analyzing trace with hash 656161628, now seen corresponding path program 60 times [2019-08-05 10:44:07,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:08,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:08,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:08,131 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,548 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:08,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,549 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:08,549 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:08,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:08,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,552 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:08,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:08,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,552 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-05 10:44:08,553 INFO L418 AbstractCegarLoop]: === Iteration 85 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash -282473254, now seen corresponding path program 61 times [2019-08-05 10:44:08,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:08,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:08,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:08,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:08,815 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,313 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:09,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:09,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,319 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:09,319 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:09,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:09,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,321 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:09,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:09,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,321 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1] [2019-08-05 10:44:09,322 INFO L418 AbstractCegarLoop]: === Iteration 86 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 684616476, now seen corresponding path program 62 times [2019-08-05 10:44:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,328 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:09,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:09,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:09,667 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,033 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:10,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,034 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:10,034 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:10,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:10,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,037 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:10,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:10,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,037 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1] [2019-08-05 10:44:10,038 INFO L418 AbstractCegarLoop]: === Iteration 87 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash 599627034, now seen corresponding path program 63 times [2019-08-05 10:44:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:10,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:10,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:10,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:10,252 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,591 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:10,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,592 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:10,592 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:10,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:10,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,595 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:10,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:10,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,595 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1] [2019-08-05 10:44:10,595 INFO L418 AbstractCegarLoop]: === Iteration 88 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2035045668, now seen corresponding path program 64 times [2019-08-05 10:44:10,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:10,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:10,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:10,978 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,296 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:11,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:11,297 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,297 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:11,297 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:11,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:11,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,301 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:11,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:11,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,302 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1] [2019-08-05 10:44:11,302 INFO L418 AbstractCegarLoop]: === Iteration 89 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2105520806, now seen corresponding path program 65 times [2019-08-05 10:44:11,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,308 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:11,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:11,651 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,944 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:11,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,945 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:11,946 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:11,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:11,949 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,949 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:11,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:11,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,950 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:44:11,951 INFO L418 AbstractCegarLoop]: === Iteration 90 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 4717212, now seen corresponding path program 66 times [2019-08-05 10:44:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:12,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:12,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:12,169 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,433 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-08-05 10:44:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:12,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,435 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:12,435 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:12,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:44:12,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:44:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,438 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:44:12,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:44:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:12,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,439 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 10:44:12,439 INFO L418 AbstractCegarLoop]: === Iteration 91 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash 997586330, now seen corresponding path program 12 times [2019-08-05 10:44:12,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:12,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:12,691 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:44:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,943 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-08-05 10:44:12,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:12,943 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:44:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,944 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:44:12,944 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:44:12,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:44:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-08-05 10:44:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:44:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-08-05 10:44:12,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2019-08-05 10:44:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,947 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-08-05 10:44:12,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-08-05 10:44:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:12,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,948 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 10:44:12,949 INFO L418 AbstractCegarLoop]: === Iteration 92 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,949 INFO L82 PathProgramCache]: Analyzing trace with hash -593399885, now seen corresponding path program 13 times [2019-08-05 10:44:12,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:13,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:13,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:13,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:13,269 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 18 states. [2019-08-05 10:44:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,909 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:13,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,910 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:13,910 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:13,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:13,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,913 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:13,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:13,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,914 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:44:13,914 INFO L418 AbstractCegarLoop]: === Iteration 93 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,915 INFO L82 PathProgramCache]: Analyzing trace with hash -593336459, now seen corresponding path program 67 times [2019-08-05 10:44:13,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:14,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:14,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:14,503 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,104 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:15,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,105 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:15,105 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:15,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:15,108 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,108 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:15,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:15,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,108 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1] [2019-08-05 10:44:15,108 INFO L418 AbstractCegarLoop]: === Iteration 94 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash -591370253, now seen corresponding path program 68 times [2019-08-05 10:44:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,114 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:15,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:15,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:15,377 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,932 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:15,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,934 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:15,934 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:15,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:15,936 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,936 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:15,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:15,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,937 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1] [2019-08-05 10:44:15,937 INFO L418 AbstractCegarLoop]: === Iteration 95 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -530417867, now seen corresponding path program 69 times [2019-08-05 10:44:15,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:16,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:16,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:16,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:16,170 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,696 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:16,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:16,697 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:16,697 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:16,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:16,699 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:16,699 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:16,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:16,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:16,700 INFO L399 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1] [2019-08-05 10:44:16,701 INFO L418 AbstractCegarLoop]: === Iteration 96 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1359106099, now seen corresponding path program 70 times [2019-08-05 10:44:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:16,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:16,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:16,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:16,920 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:17,436 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:17,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,438 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:17,438 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:17,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:17,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,441 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:17,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:17,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,442 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1] [2019-08-05 10:44:17,442 INFO L418 AbstractCegarLoop]: === Iteration 97 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:17,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -195193099, now seen corresponding path program 71 times [2019-08-05 10:44:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:17,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:17,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:17,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:17,827 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:19,125 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:44:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:19,336 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:19,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:19,337 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:19,338 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:19,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:19,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:19,340 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:19,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:19,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:19,340 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2019-08-05 10:44:19,340 INFO L418 AbstractCegarLoop]: === Iteration 98 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1133827981, now seen corresponding path program 72 times [2019-08-05 10:44:19,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:19,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:19,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:19,474 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:44:19,984 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:44:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:20,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:20,822 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,278 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:21,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,280 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:21,280 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:21,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:21,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:21,282 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:21,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:21,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:21,283 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2019-08-05 10:44:21,284 INFO L418 AbstractCegarLoop]: === Iteration 99 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash -166738251, now seen corresponding path program 73 times [2019-08-05 10:44:21,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:21,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:21,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:21,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:21,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:21,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:21,566 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:22,010 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:22,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:22,011 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:22,012 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:22,012 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:22,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:22,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:22,015 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:22,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:22,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:22,016 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1] [2019-08-05 10:44:22,016 INFO L418 AbstractCegarLoop]: === Iteration 100 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash -251727693, now seen corresponding path program 74 times [2019-08-05 10:44:22,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:22,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:22,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:22,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:22,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:22,265 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,163 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:23,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,165 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:23,165 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:23,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:23,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,167 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:23,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:23,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,168 INFO L399 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1] [2019-08-05 10:44:23,168 INFO L418 AbstractCegarLoop]: === Iteration 101 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1408566901, now seen corresponding path program 75 times [2019-08-05 10:44:23,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:23,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:23,405 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,777 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:23,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,778 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:23,778 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:23,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:23,781 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,781 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:23,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:23,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,782 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1] [2019-08-05 10:44:23,782 INFO L418 AbstractCegarLoop]: === Iteration 102 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1338091763, now seen corresponding path program 76 times [2019-08-05 10:44:23,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:24,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:24,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:24,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:24,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:24,036 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,347 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:26,347 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,348 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:26,348 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:26,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:26,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,350 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:26,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:26,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,351 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1] [2019-08-05 10:44:26,351 INFO L418 AbstractCegarLoop]: === Iteration 103 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash -846637515, now seen corresponding path program 77 times [2019-08-05 10:44:26,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,357 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:26,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:26,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:26,592 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,910 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:26,910 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,911 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:26,911 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:26,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:26,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,913 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:26,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:26,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,914 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:44:26,914 INFO L418 AbstractCegarLoop]: === Iteration 104 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 146231603, now seen corresponding path program 78 times [2019-08-05 10:44:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:27,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:27,149 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,447 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-08-05 10:44:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:27,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,448 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:27,448 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:27,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:44:27,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:44:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,451 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:44:27,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:44:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:27,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,452 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 10:44:27,452 INFO L418 AbstractCegarLoop]: === Iteration 105 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash 860403189, now seen corresponding path program 13 times [2019-08-05 10:44:27,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:27,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:27,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:27,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:27,712 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:44:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:28,000 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-08-05 10:44:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:28,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:44:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:28,001 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:44:28,001 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:44:28,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:44:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2019-08-05 10:44:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:44:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2019-08-05 10:44:28,003 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2019-08-05 10:44:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-08-05 10:44:28,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2019-08-05 10:44:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:28,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:28,004 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 10:44:28,004 INFO L418 AbstractCegarLoop]: === Iteration 106 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1215592646, now seen corresponding path program 14 times [2019-08-05 10:44:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:28,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:44:28,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:28,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:28,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:28,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:28,277 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 19 states. [2019-08-05 10:44:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:29,020 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:29,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:29,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:29,021 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:29,021 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:29,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:29,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:29,024 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:29,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:29,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:29,024 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:44:29,025 INFO L418 AbstractCegarLoop]: === Iteration 107 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1215529220, now seen corresponding path program 79 times [2019-08-05 10:44:29,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:29,030 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:29,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:29,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:29,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:29,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:29,360 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:30,175 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:30,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:30,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:30,176 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:30,176 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:30,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:30,179 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:30,180 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:30,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:30,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:30,180 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1] [2019-08-05 10:44:30,181 INFO L418 AbstractCegarLoop]: === Iteration 108 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1213563014, now seen corresponding path program 80 times [2019-08-05 10:44:30,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:30,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:30,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:30,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:30,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:30,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:30,432 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,056 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:31,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,058 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:31,058 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:31,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:31,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,060 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:31,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:31,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,061 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1] [2019-08-05 10:44:31,061 INFO L418 AbstractCegarLoop]: === Iteration 109 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1152610628, now seen corresponding path program 81 times [2019-08-05 10:44:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,065 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:31,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:31,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:31,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:31,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:31,306 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,912 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:31,913 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,913 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:31,913 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:31,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:31,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,916 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:31,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:31,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,916 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1] [2019-08-05 10:44:31,917 INFO L418 AbstractCegarLoop]: === Iteration 110 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash 736913338, now seen corresponding path program 82 times [2019-08-05 10:44:31,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,922 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:32,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:32,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:32,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:32,196 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:32,781 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:32,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:32,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:32,782 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:32,782 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:32,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:32,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:32,785 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:32,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:32,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:32,786 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1] [2019-08-05 10:44:32,786 INFO L418 AbstractCegarLoop]: === Iteration 111 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -817385860, now seen corresponding path program 83 times [2019-08-05 10:44:32,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:32,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:32,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:33,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:33,049 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,627 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:33,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,629 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:33,629 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:33,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:33,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,631 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:33,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:33,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,632 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1] [2019-08-05 10:44:33,632 INFO L418 AbstractCegarLoop]: === Iteration 112 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1756020742, now seen corresponding path program 84 times [2019-08-05 10:44:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:33,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:33,912 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:34,434 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:34,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:34,436 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:34,436 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:34,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:34,438 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:34,438 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:34,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:34,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:34,439 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-05 10:44:34,439 INFO L418 AbstractCegarLoop]: === Iteration 113 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash -788931012, now seen corresponding path program 85 times [2019-08-05 10:44:34,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:34,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:34,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:34,579 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:44:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:35,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:35,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:35,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:35,044 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:35,542 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:35,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:35,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:35,544 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:35,544 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:35,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:35,546 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:35,546 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:35,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:35,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:35,547 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1] [2019-08-05 10:44:35,547 INFO L418 AbstractCegarLoop]: === Iteration 114 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash -873920454, now seen corresponding path program 86 times [2019-08-05 10:44:35,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:35,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:35,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:35,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:35,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:35,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:35,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:35,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:35,815 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:36,274 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:36,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:36,275 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:36,275 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:36,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:36,278 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:36,278 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:36,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:36,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:36,279 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1] [2019-08-05 10:44:36,279 INFO L418 AbstractCegarLoop]: === Iteration 115 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash 786374140, now seen corresponding path program 87 times [2019-08-05 10:44:36,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:36,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:36,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:36,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:36,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:36,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:36,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:36,754 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,190 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:37,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,191 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:37,191 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:37,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:37,193 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,193 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:37,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:37,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,194 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1] [2019-08-05 10:44:37,194 INFO L418 AbstractCegarLoop]: === Iteration 116 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash 715899002, now seen corresponding path program 88 times [2019-08-05 10:44:37,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:37,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:37,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:37,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:37,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:37,594 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:38,003 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:38,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:38,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:38,004 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:38,004 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:38,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:38,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:38,007 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:38,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:38,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:38,008 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1] [2019-08-05 10:44:38,008 INFO L418 AbstractCegarLoop]: === Iteration 117 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1468830276, now seen corresponding path program 89 times [2019-08-05 10:44:38,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:38,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:38,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:38,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:38,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:38,263 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:38,649 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:38,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:38,650 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:38,650 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:38,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:38,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:38,652 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:38,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:38,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:38,653 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1] [2019-08-05 10:44:38,653 INFO L418 AbstractCegarLoop]: === Iteration 118 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -475961158, now seen corresponding path program 90 times [2019-08-05 10:44:38,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:38,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:38,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:38,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:38,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:38,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:38,920 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,273 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:39,274 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,274 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:39,275 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:39,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:39,276 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,277 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:39,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:39,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,278 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:44:39,278 INFO L418 AbstractCegarLoop]: === Iteration 119 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash 238210428, now seen corresponding path program 91 times [2019-08-05 10:44:39,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:39,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:39,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:39,512 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,921 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2019-08-05 10:44:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:39,921 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,922 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:39,922 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:39,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:44:39,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:44:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,925 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:44:39,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:44:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:39,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,925 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 10:44:39,926 INFO L418 AbstractCegarLoop]: === Iteration 120 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,926 INFO L82 PathProgramCache]: Analyzing trace with hash 902693114, now seen corresponding path program 14 times [2019-08-05 10:44:39,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:40,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:44:40,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:44:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:44:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:40,260 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:44:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:40,568 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-08-05 10:44:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:44:40,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:44:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:40,569 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:44:40,569 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:44:40,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:44:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-08-05 10:44:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:44:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2019-08-05 10:44:40,571 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 18 [2019-08-05 10:44:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:40,571 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2019-08-05 10:44:40,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:44:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2019-08-05 10:44:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:40,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:40,572 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 10:44:40,572 INFO L418 AbstractCegarLoop]: === Iteration 121 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 971268243, now seen corresponding path program 15 times [2019-08-05 10:44:40,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:40,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:44:40,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:40,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:40,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:40,905 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 20 states. [2019-08-05 10:44:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:41,722 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:41,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:41,723 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:41,723 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:41,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:41,726 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:41,726 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:41,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:41,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:41,727 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:44:41,727 INFO L418 AbstractCegarLoop]: === Iteration 122 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash 971331669, now seen corresponding path program 92 times [2019-08-05 10:44:41,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:41,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:41,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:42,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:42,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:42,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:42,055 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:42,783 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:42,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:42,784 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:42,784 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:42,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:42,786 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:42,786 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:42,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:42,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:42,787 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1] [2019-08-05 10:44:42,787 INFO L418 AbstractCegarLoop]: === Iteration 123 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash 973297875, now seen corresponding path program 93 times [2019-08-05 10:44:42,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:42,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:42,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:43,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:43,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:43,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:43,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:43,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:43,058 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:43,767 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:43,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:43,769 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:43,769 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:43,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:43,771 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:43,771 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:43,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:43,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:43,772 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1] [2019-08-05 10:44:43,772 INFO L418 AbstractCegarLoop]: === Iteration 124 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1034250261, now seen corresponding path program 94 times [2019-08-05 10:44:43,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:43,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:43,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:44,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:44,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:44,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:44,055 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:44,732 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:44,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:44,733 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:44,733 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:44,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:44,735 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:44,736 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:44,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:44,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:44,736 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1] [2019-08-05 10:44:44,737 INFO L418 AbstractCegarLoop]: === Iteration 125 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:44,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1371193069, now seen corresponding path program 95 times [2019-08-05 10:44:44,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:44,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:44,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:45,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:45,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:45,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:45,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:45,230 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,908 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:45,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,909 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:45,909 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:45,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:45,911 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,912 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:45,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:45,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,913 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1] [2019-08-05 10:44:45,913 INFO L418 AbstractCegarLoop]: === Iteration 126 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1369475029, now seen corresponding path program 96 times [2019-08-05 10:44:45,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:46,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:46,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:46,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:46,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:46,190 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:46,819 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:46,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:46,820 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:46,820 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:46,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:46,822 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:46,823 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:46,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:46,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:46,823 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1] [2019-08-05 10:44:46,823 INFO L418 AbstractCegarLoop]: === Iteration 127 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash 430840147, now seen corresponding path program 97 times [2019-08-05 10:44:46,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:46,828 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:46,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:47,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:47,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:47,076 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:47,670 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:47,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:47,671 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:47,671 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:47,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:47,674 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:47,674 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:47,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:47,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:47,675 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-08-05 10:44:47,675 INFO L418 AbstractCegarLoop]: === Iteration 128 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1397929877, now seen corresponding path program 98 times [2019-08-05 10:44:47,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:47,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:47,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:48,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:48,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:48,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:48,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:48,113 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:48,680 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:48,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:48,682 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:48,682 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:48,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:48,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:48,685 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:48,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:48,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:48,686 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-08-05 10:44:48,686 INFO L418 AbstractCegarLoop]: === Iteration 129 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1312940435, now seen corresponding path program 99 times [2019-08-05 10:44:48,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:48,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:48,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:48,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:48,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:48,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:48,950 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:49,581 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:49,581 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:49,582 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:49,582 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:49,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:49,585 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:49,585 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:49,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:49,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:49,586 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1] [2019-08-05 10:44:49,586 INFO L418 AbstractCegarLoop]: === Iteration 130 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1321732267, now seen corresponding path program 100 times [2019-08-05 10:44:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:49,592 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:49,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:49,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:49,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:49,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:49,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:49,910 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:50,515 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:50,516 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:50,516 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:50,516 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:50,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:50,518 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:50,519 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:50,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:50,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:50,520 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1] [2019-08-05 10:44:50,520 INFO L418 AbstractCegarLoop]: === Iteration 131 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1392207405, now seen corresponding path program 101 times [2019-08-05 10:44:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:50,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:50,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:50,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:50,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:50,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:50,787 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:51,279 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:51,279 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:51,280 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:51,280 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:51,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:51,282 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:51,282 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:51,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:51,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:51,283 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1] [2019-08-05 10:44:51,283 INFO L418 AbstractCegarLoop]: === Iteration 132 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash 718030613, now seen corresponding path program 102 times [2019-08-05 10:44:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:51,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:51,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:51,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:51,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:51,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:51,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:51,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:51,565 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:52,008 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:52,008 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:52,009 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:52,009 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:52,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:52,011 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:52,011 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:52,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:52,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:52,012 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1] [2019-08-05 10:44:52,012 INFO L418 AbstractCegarLoop]: === Iteration 133 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1710899731, now seen corresponding path program 103 times [2019-08-05 10:44:52,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:52,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:52,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:52,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:52,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:52,274 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:52,690 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:52,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:52,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:52,691 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:52,691 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:52,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:52,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:52,693 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:52,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:52,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:52,694 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1] [2019-08-05 10:44:52,694 INFO L418 AbstractCegarLoop]: === Iteration 134 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:52,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1869895979, now seen corresponding path program 104 times [2019-08-05 10:44:52,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:52,700 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:52,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:53,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:53,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:53,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:53,013 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,402 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:53,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:53,402 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,403 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:53,403 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:53,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:53,405 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,406 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:53,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:53,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,406 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:44:53,406 INFO L418 AbstractCegarLoop]: === Iteration 135 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1205413293, now seen corresponding path program 105 times [2019-08-05 10:44:53,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:53,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:53,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:53,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:53,677 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,036 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-08-05 10:44:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:54,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,037 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:54,037 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:54,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:44:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:44:54,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:44:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,039 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:44:54,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:44:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:54,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,039 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 10:44:54,039 INFO L418 AbstractCegarLoop]: === Iteration 136 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2081286507, now seen corresponding path program 15 times [2019-08-05 10:44:54,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:54,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:44:54,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:44:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:44:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:44:54,347 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:44:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,688 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2019-08-05 10:44:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:44:54,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:44:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,689 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:44:54,689 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:44:54,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:44:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:44:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-08-05 10:44:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:44:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2019-08-05 10:44:54,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2019-08-05 10:44:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,691 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-08-05 10:44:54,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:44:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2019-08-05 10:44:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:54,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,692 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 10:44:54,693 INFO L418 AbstractCegarLoop]: === Iteration 137 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash 44479066, now seen corresponding path program 16 times [2019-08-05 10:44:54,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:55,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:55,053 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 21 states. [2019-08-05 10:44:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,066 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:44:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:56,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,067 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:44:56,067 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:44:56,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:44:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:44:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:44:56,070 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:44:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,070 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:44:56,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:44:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:56,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,071 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:44:56,072 INFO L418 AbstractCegarLoop]: === Iteration 138 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 44542492, now seen corresponding path program 106 times [2019-08-05 10:44:56,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:56,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:56,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:56,364 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:44:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,175 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:44:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:57,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,176 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:44:57,177 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:44:57,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:44:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:44:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:44:57,178 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:44:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,179 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:44:57,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:44:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:57,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,180 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1] [2019-08-05 10:44:57,180 INFO L418 AbstractCegarLoop]: === Iteration 139 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 46508698, now seen corresponding path program 107 times [2019-08-05 10:44:57,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,184 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:57,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:57,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:57,468 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:44:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,252 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:44:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:58,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,254 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:44:58,254 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:44:58,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:44:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:44:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:44:58,256 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:44:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,257 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:44:58,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:44:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:58,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,258 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1] [2019-08-05 10:44:58,258 INFO L418 AbstractCegarLoop]: === Iteration 140 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash 107461084, now seen corresponding path program 108 times [2019-08-05 10:44:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:58,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:58,551 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:44:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,308 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:44:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:44:59,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:44:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,309 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:44:59,310 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:44:59,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:44:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:44:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:44:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:44:59,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:44:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,312 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:44:59,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:44:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:44:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:44:59,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,312 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1] [2019-08-05 10:44:59,312 INFO L418 AbstractCegarLoop]: === Iteration 141 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:44:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1996985050, now seen corresponding path program 109 times [2019-08-05 10:44:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:44:59,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:44:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:44:59,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:44:59,606 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,480 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:00,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,481 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:00,481 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:00,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:00,482 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,483 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:00,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:00,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,483 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1] [2019-08-05 10:45:00,483 INFO L418 AbstractCegarLoop]: === Iteration 142 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 442685852, now seen corresponding path program 110 times [2019-08-05 10:45:00,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:00,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:00,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:00,793 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,516 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:01,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,517 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:01,518 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:01,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:01,519 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,520 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:01,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:01,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,520 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1] [2019-08-05 10:45:01,521 INFO L418 AbstractCegarLoop]: === Iteration 143 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -495949030, now seen corresponding path program 111 times [2019-08-05 10:45:01,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:01,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:01,823 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,494 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:02,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:02,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,495 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:02,495 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:02,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:02,497 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,497 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:02,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:02,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,498 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1] [2019-08-05 10:45:02,499 INFO L418 AbstractCegarLoop]: === Iteration 144 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash 471140700, now seen corresponding path program 112 times [2019-08-05 10:45:02,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:02,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:02,788 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,429 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:03,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,430 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:03,430 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:03,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:03,433 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,433 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:03,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:03,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,434 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-05 10:45:03,435 INFO L418 AbstractCegarLoop]: === Iteration 145 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,435 INFO L82 PathProgramCache]: Analyzing trace with hash 386151258, now seen corresponding path program 113 times [2019-08-05 10:45:03,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:03,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:03,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:03,952 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,576 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:04,576 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,577 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:04,577 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:04,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:04,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:04,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,580 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:04,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:04,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,580 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1] [2019-08-05 10:45:04,580 INFO L418 AbstractCegarLoop]: === Iteration 146 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2046445852, now seen corresponding path program 114 times [2019-08-05 10:45:04,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:04,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:04,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:04,862 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,533 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:05,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,534 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:05,534 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:05,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:05,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,535 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:05,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:05,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,536 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1] [2019-08-05 10:45:05,536 INFO L418 AbstractCegarLoop]: === Iteration 147 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1975970714, now seen corresponding path program 115 times [2019-08-05 10:45:05,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:05,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:05,892 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,446 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:06,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,447 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:06,447 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:06,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:06,449 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,449 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:06,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:06,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,452 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1] [2019-08-05 10:45:06,453 INFO L418 AbstractCegarLoop]: === Iteration 148 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash -208758564, now seen corresponding path program 116 times [2019-08-05 10:45:06,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:07,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:07,154 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:07,674 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:07,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:07,675 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:07,675 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:07,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:07,677 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:07,677 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:07,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:07,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:07,678 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1] [2019-08-05 10:45:07,678 INFO L418 AbstractCegarLoop]: === Iteration 149 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash 784110554, now seen corresponding path program 117 times [2019-08-05 10:45:07,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:07,682 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:07,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:07,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:07,963 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,475 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:08,475 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,476 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:08,476 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:08,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:08,478 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,478 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:08,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:08,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,479 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1] [2019-08-05 10:45:08,479 INFO L418 AbstractCegarLoop]: === Iteration 150 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1498282140, now seen corresponding path program 118 times [2019-08-05 10:45:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:08,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:08,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:08,786 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,246 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:09,246 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,247 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:09,247 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:09,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:09,249 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,250 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:09,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:09,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:09,251 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1] [2019-08-05 10:45:09,251 INFO L418 AbstractCegarLoop]: === Iteration 151 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2132202470, now seen corresponding path program 119 times [2019-08-05 10:45:09,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,412 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:45:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:09,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:09,829 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,252 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:10,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,253 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:10,253 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:10,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:10,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,256 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:10,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:10,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,256 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:45:10,256 INFO L418 AbstractCegarLoop]: === Iteration 152 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1286891612, now seen corresponding path program 120 times [2019-08-05 10:45:10,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:10,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:10,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:10,750 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,149 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-08-05 10:45:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:11,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,150 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:11,150 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:11,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:45:11,152 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:45:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,152 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:45:11,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:45:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:11,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,153 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 10:45:11,153 INFO L418 AbstractCegarLoop]: === Iteration 153 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash -95374246, now seen corresponding path program 16 times [2019-08-05 10:45:11,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:11,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:11,474 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:45:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,855 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-08-05 10:45:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:11,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:45:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,856 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:45:11,856 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:11,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-08-05 10:45:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:45:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2019-08-05 10:45:11,858 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 20 [2019-08-05 10:45:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,858 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2019-08-05 10:45:11,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2019-08-05 10:45:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:11,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,859 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 10:45:11,859 INFO L418 AbstractCegarLoop]: === Iteration 154 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1378785651, now seen corresponding path program 17 times [2019-08-05 10:45:11,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:12,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:12,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:12,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:12,229 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand 22 states. [2019-08-05 10:45:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,285 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:13,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:13,286 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,287 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:13,287 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:13,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:13,291 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,292 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:13,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:13,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,292 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:45:13,293 INFO L418 AbstractCegarLoop]: === Iteration 155 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1378849077, now seen corresponding path program 121 times [2019-08-05 10:45:13,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:13,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:13,633 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,533 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:14,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,534 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:14,534 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:14,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:14,537 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,537 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:14,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:14,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,537 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1] [2019-08-05 10:45:14,538 INFO L418 AbstractCegarLoop]: === Iteration 156 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1380815283, now seen corresponding path program 122 times [2019-08-05 10:45:14,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:14,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:14,872 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,899 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:15,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,900 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:15,900 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:15,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:15,901 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,901 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:15,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:15,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,902 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1] [2019-08-05 10:45:15,902 INFO L418 AbstractCegarLoop]: === Iteration 157 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1441767669, now seen corresponding path program 123 times [2019-08-05 10:45:15,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:16,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:16,333 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:17,193 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:17,193 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:17,194 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:17,194 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:17,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:17,196 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:17,196 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:17,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:17,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:17,197 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1] [2019-08-05 10:45:17,197 INFO L418 AbstractCegarLoop]: === Iteration 158 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash -963675661, now seen corresponding path program 124 times [2019-08-05 10:45:17,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:17,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:17,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:17,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:17,536 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:18,351 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:18,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:18,351 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:18,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:18,352 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:18,352 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:18,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:18,353 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:18,354 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:18,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:18,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:18,355 INFO L399 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1] [2019-08-05 10:45:18,355 INFO L418 AbstractCegarLoop]: === Iteration 159 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1776992437, now seen corresponding path program 125 times [2019-08-05 10:45:18,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:18,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:18,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:18,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:18,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:18,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:18,682 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,465 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:19,466 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,466 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:19,466 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:19,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:19,469 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,469 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:19,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:19,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,469 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1] [2019-08-05 10:45:19,469 INFO L418 AbstractCegarLoop]: === Iteration 160 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 838357555, now seen corresponding path program 126 times [2019-08-05 10:45:19,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:19,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:19,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:19,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:19,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:19,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:19,901 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:20,675 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:20,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:20,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,677 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:20,677 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:20,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:20,678 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,678 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:20,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:20,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,678 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1] [2019-08-05 10:45:20,679 INFO L418 AbstractCegarLoop]: === Iteration 161 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1805447285, now seen corresponding path program 127 times [2019-08-05 10:45:20,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:21,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:21,167 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,893 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:21,894 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,894 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:21,895 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:21,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:21,897 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,897 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:21,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:21,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,898 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1] [2019-08-05 10:45:21,898 INFO L418 AbstractCegarLoop]: === Iteration 162 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1720457843, now seen corresponding path program 128 times [2019-08-05 10:45:21,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:22,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:22,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:22,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:22,211 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:22,895 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:22,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:22,896 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:22,896 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:22,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:22,898 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:22,898 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:22,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:22,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:22,898 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1] [2019-08-05 10:45:22,899 INFO L418 AbstractCegarLoop]: === Iteration 163 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -914214859, now seen corresponding path program 129 times [2019-08-05 10:45:22,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:22,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:22,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:23,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:23,213 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:23,830 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:23,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:23,831 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:23,831 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:23,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:23,833 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:23,833 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:23,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:23,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:23,834 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1] [2019-08-05 10:45:23,834 INFO L418 AbstractCegarLoop]: === Iteration 164 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash -984689997, now seen corresponding path program 130 times [2019-08-05 10:45:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:23,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:23,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:24,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:24,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:24,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:24,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:24,178 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,813 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:24,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,814 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:24,814 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:24,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:24,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,816 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:24,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:24,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,817 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1] [2019-08-05 10:45:24,817 INFO L418 AbstractCegarLoop]: === Iteration 165 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1125548021, now seen corresponding path program 131 times [2019-08-05 10:45:24,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:25,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:25,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:25,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:25,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:25,132 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:25,743 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:25,744 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:25,745 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:25,745 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:25,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:25,746 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:25,747 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:25,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:25,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:25,747 INFO L399 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1] [2019-08-05 10:45:25,747 INFO L418 AbstractCegarLoop]: === Iteration 166 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2118417139, now seen corresponding path program 132 times [2019-08-05 10:45:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:25,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:25,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:26,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:26,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:26,210 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:26,777 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:26,777 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:26,778 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:26,778 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:26,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:26,780 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:26,780 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:26,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:26,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:26,781 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1] [2019-08-05 10:45:26,781 INFO L418 AbstractCegarLoop]: === Iteration 167 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1462378571, now seen corresponding path program 133 times [2019-08-05 10:45:26,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:26,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:26,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:27,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:27,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:27,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:27,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:27,119 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:27,745 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:27,746 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:27,746 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:27,746 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:27,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:27,748 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,749 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:27,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:27,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,749 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1] [2019-08-05 10:45:27,750 INFO L418 AbstractCegarLoop]: === Iteration 168 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -797895885, now seen corresponding path program 134 times [2019-08-05 10:45:27,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:27,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:27,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,037 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:45:28,215 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:45:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:28,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:28,747 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:29,246 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:29,247 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:29,248 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:29,248 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:29,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:29,249 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:29,250 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:29,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:29,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:29,251 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1] [2019-08-05 10:45:29,251 INFO L418 AbstractCegarLoop]: === Iteration 169 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:29,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:29,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1673769099, now seen corresponding path program 135 times [2019-08-05 10:45:29,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:29,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:29,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:29,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:29,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:29,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:29,584 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:30,046 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:30,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:30,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:30,047 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:30,047 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:30,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:30,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:30,049 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:30,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:30,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:30,050 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:45:30,050 INFO L418 AbstractCegarLoop]: === Iteration 170 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1238932339, now seen corresponding path program 136 times [2019-08-05 10:45:30,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:30,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:45:30,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:30,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:30,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:30,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:30,386 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:30,810 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-08-05 10:45:30,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:30,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:30,811 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:30,811 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:30,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:45:30,813 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:45:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:30,813 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:45:30,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:45:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:30,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:30,814 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 10:45:30,814 INFO L418 AbstractCegarLoop]: === Iteration 171 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1338363701, now seen corresponding path program 17 times [2019-08-05 10:45:30,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:30,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:45:30,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:31,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:31,318 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:45:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,728 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-08-05 10:45:31,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:31,728 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:45:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,729 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:45:31,729 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:45:31,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:45:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-08-05 10:45:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2019-08-05 10:45:31,731 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 21 [2019-08-05 10:45:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,731 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2019-08-05 10:45:31,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2019-08-05 10:45:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:31,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,732 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 10:45:31,732 INFO L418 AbstractCegarLoop]: === Iteration 172 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,732 INFO L82 PathProgramCache]: Analyzing trace with hash -207383174, now seen corresponding path program 18 times [2019-08-05 10:45:31,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:32,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:32,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:32,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:32,150 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand 23 states. [2019-08-05 10:45:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:33,257 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:33,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:33,258 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:33,259 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:33,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:33,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:33,261 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:33,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:33,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:33,261 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:45:33,262 INFO L418 AbstractCegarLoop]: === Iteration 173 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash -207319748, now seen corresponding path program 137 times [2019-08-05 10:45:33,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:33,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:33,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:33,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:33,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:33,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:33,593 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,602 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:34,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,603 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:34,604 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:34,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:34,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,606 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:34,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:34,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,606 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1] [2019-08-05 10:45:34,606 INFO L418 AbstractCegarLoop]: === Iteration 174 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -205353542, now seen corresponding path program 138 times [2019-08-05 10:45:34,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:34,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:34,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:34,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:34,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:34,959 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,925 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:35,926 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,926 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:35,926 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:35,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:35,928 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,928 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:35,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:35,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,929 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1] [2019-08-05 10:45:35,929 INFO L418 AbstractCegarLoop]: === Iteration 175 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash -144401156, now seen corresponding path program 139 times [2019-08-05 10:45:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:36,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:36,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:36,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:36,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:36,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:36,478 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,402 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:37,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,403 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:37,403 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:37,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:37,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,406 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:37,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:37,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,407 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1] [2019-08-05 10:45:37,407 INFO L418 AbstractCegarLoop]: === Iteration 176 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1745122810, now seen corresponding path program 140 times [2019-08-05 10:45:37,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:37,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:37,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:37,803 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,688 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:38,688 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,689 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:38,689 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:38,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:38,691 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,691 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:38,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:38,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,692 INFO L399 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1] [2019-08-05 10:45:38,692 INFO L418 AbstractCegarLoop]: === Iteration 177 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 190823612, now seen corresponding path program 141 times [2019-08-05 10:45:38,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:39,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:39,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:39,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:39,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:39,023 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,874 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:39,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:39,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,875 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:39,875 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:39,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:39,876 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,877 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:39,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:39,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,877 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1] [2019-08-05 10:45:39,878 INFO L418 AbstractCegarLoop]: === Iteration 178 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash -747811270, now seen corresponding path program 142 times [2019-08-05 10:45:39,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,883 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:40,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:40,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:40,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:40,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:40,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:40,279 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:41,105 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:41,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:41,106 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:41,106 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:41,106 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:41,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:41,107 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:41,107 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:41,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:41,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:41,108 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1] [2019-08-05 10:45:41,108 INFO L418 AbstractCegarLoop]: === Iteration 179 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:41,108 INFO L82 PathProgramCache]: Analyzing trace with hash 219278460, now seen corresponding path program 143 times [2019-08-05 10:45:41,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:41,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:41,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:41,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:41,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:41,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:41,659 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,460 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:42,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,461 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:42,461 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:42,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:42,463 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,463 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:42,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:42,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,464 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1] [2019-08-05 10:45:42,464 INFO L418 AbstractCegarLoop]: === Iteration 180 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash 134289018, now seen corresponding path program 144 times [2019-08-05 10:45:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:42,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:42,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:42,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:42,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:42,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:42,909 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:43,666 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:43,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:43,667 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:43,667 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:43,668 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:43,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:43,669 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:43,670 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:43,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:43,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:43,670 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-05 10:45:43,671 INFO L418 AbstractCegarLoop]: === Iteration 181 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1794583612, now seen corresponding path program 145 times [2019-08-05 10:45:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:43,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:44,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:44,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:44,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:44,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:44,005 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:44,719 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:44,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:44,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:44,720 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:44,720 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:44,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:44,722 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:44,722 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:44,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:44,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:44,723 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1] [2019-08-05 10:45:44,724 INFO L418 AbstractCegarLoop]: === Iteration 182 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1724108474, now seen corresponding path program 146 times [2019-08-05 10:45:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:44,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:44,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:45,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:45,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:45,243 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,920 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:45,921 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,921 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:45,921 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:45,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:45,923 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,923 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:45,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:45,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,924 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1] [2019-08-05 10:45:45,924 INFO L418 AbstractCegarLoop]: === Iteration 183 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash -460620804, now seen corresponding path program 147 times [2019-08-05 10:45:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:45,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:45,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:46,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:46,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:46,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:46,511 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:47,162 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:47,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:47,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:47,163 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:47,163 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:47,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:47,165 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:47,165 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:47,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:47,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:47,166 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1] [2019-08-05 10:45:47,166 INFO L418 AbstractCegarLoop]: === Iteration 184 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash 532248314, now seen corresponding path program 148 times [2019-08-05 10:45:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:47,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:47,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:47,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:47,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:47,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:47,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:47,511 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:48,123 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:48,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:48,124 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:48,124 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:48,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:48,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:48,126 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:48,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:48,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:48,127 INFO L399 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1] [2019-08-05 10:45:48,127 INFO L418 AbstractCegarLoop]: === Iteration 185 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1246419900, now seen corresponding path program 149 times [2019-08-05 10:45:48,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:48,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:48,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:48,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:48,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:48,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:48,489 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,072 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:49,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:49,072 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,073 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:49,073 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:49,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:49,075 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,075 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:49,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:49,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,076 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1] [2019-08-05 10:45:49,076 INFO L418 AbstractCegarLoop]: === Iteration 186 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1910902586, now seen corresponding path program 150 times [2019-08-05 10:45:49,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:49,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:49,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:49,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:49,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:49,411 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,966 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:49,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,967 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:49,968 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:49,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:49,969 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,970 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:49,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:49,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,970 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1] [2019-08-05 10:45:49,971 INFO L418 AbstractCegarLoop]: === Iteration 187 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1035029372, now seen corresponding path program 151 times [2019-08-05 10:45:49,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:50,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:50,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:50,326 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:50,836 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:50,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:50,837 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:50,837 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:50,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:50,839 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:50,839 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:50,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:50,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:50,840 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1] [2019-08-05 10:45:50,840 INFO L418 AbstractCegarLoop]: === Iteration 188 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash -347236486, now seen corresponding path program 152 times [2019-08-05 10:45:50,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:50,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:50,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:51,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:51,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:51,216 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:51,795 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:51,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:51,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:51,796 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:51,796 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:51,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:51,798 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:51,799 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:51,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:51,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:51,800 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:45:51,800 INFO L418 AbstractCegarLoop]: === Iteration 189 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:51,800 INFO L82 PathProgramCache]: Analyzing trace with hash -247805124, now seen corresponding path program 153 times [2019-08-05 10:45:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:51,806 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:45:51,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:52,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:52,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:52,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:52,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:52,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:52,279 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:52,729 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2019-08-05 10:45:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:52,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:52,730 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:52,730 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:52,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:45:52,732 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:45:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:52,732 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:45:52,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:45:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:52,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:52,733 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 10:45:52,733 INFO L418 AbstractCegarLoop]: === Iteration 190 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:52,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:52,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1460400198, now seen corresponding path program 18 times [2019-08-05 10:45:52,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:52,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:45:52,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:53,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:53,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:45:53,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:45:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:45:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:53,102 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:45:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:53,539 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2019-08-05 10:45:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:45:53,540 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:45:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:53,540 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:45:53,540 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:45:53,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:45:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:45:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2019-08-05 10:45:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:45:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2019-08-05 10:45:53,542 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 22 [2019-08-05 10:45:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:53,542 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2019-08-05 10:45:53,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:45:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2019-08-05 10:45:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:53,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:53,542 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 10:45:53,543 INFO L418 AbstractCegarLoop]: === Iteration 191 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2133976493, now seen corresponding path program 19 times [2019-08-05 10:45:53,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:53,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:45:53,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:53,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:53,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:53,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:53,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:53,940 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 24 states. [2019-08-05 10:45:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:55,115 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:45:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:55,115 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:45:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:55,116 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:55,116 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:55,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:45:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:45:55,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:45:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:55,118 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:45:55,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:45:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:55,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:55,118 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:45:55,119 INFO L418 AbstractCegarLoop]: === Iteration 192 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2133913067, now seen corresponding path program 154 times [2019-08-05 10:45:55,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:55,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:45:55,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:55,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:55,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:55,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:55,486 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:45:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:56,629 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:45:56,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:56,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:45:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:56,630 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:56,630 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:56,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:45:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:45:56,631 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:45:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:56,632 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:45:56,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:45:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:56,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:56,633 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1] [2019-08-05 10:45:56,633 INFO L418 AbstractCegarLoop]: === Iteration 193 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:56,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2131946861, now seen corresponding path program 155 times [2019-08-05 10:45:56,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:56,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:45:56,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:57,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:57,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:57,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:57,120 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:45:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:58,138 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:45:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:58,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:45:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:58,139 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:58,139 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:58,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:45:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:45:58,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:45:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:58,142 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:45:58,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:45:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:58,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:58,143 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1] [2019-08-05 10:45:58,143 INFO L418 AbstractCegarLoop]: === Iteration 194 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2070994475, now seen corresponding path program 156 times [2019-08-05 10:45:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:58,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:45:58,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:58,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:58,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:58,524 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:45:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:59,517 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:45:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:45:59,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:45:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:59,518 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:59,518 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:59,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:45:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:45:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:45:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:45:59,519 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:45:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:59,520 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:45:59,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:45:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:45:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:45:59,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:59,520 INFO L399 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1] [2019-08-05 10:45:59,521 INFO L418 AbstractCegarLoop]: === Iteration 195 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:45:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash -181470509, now seen corresponding path program 157 times [2019-08-05 10:45:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:59,526 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:45:59,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:59,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:45:59,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:45:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:45:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:45:59,881 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:00,853 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:00,853 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:00,854 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:00,854 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:00,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:00,856 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:00,856 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:00,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:00,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:00,857 INFO L399 BasicCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1] [2019-08-05 10:46:00,857 INFO L418 AbstractCegarLoop]: === Iteration 196 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:00,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1735769707, now seen corresponding path program 158 times [2019-08-05 10:46:00,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:00,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:00,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:01,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:01,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:01,208 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:02,246 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:02,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:02,247 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:02,247 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:02,247 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:02,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:02,249 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:02,249 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:02,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:02,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:02,250 INFO L399 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1] [2019-08-05 10:46:02,250 INFO L418 AbstractCegarLoop]: === Iteration 197 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1620562707, now seen corresponding path program 159 times [2019-08-05 10:46:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:02,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:02,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:02,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:02,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:02,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:02,688 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:03,591 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:03,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:03,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:03,592 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:03,592 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:03,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:03,594 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:03,594 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:03,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:03,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:03,594 INFO L399 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1] [2019-08-05 10:46:03,595 INFO L418 AbstractCegarLoop]: === Iteration 198 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1707314859, now seen corresponding path program 160 times [2019-08-05 10:46:03,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:03,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:03,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:06,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:06,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:06,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:06,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:06,298 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:07,250 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:07,250 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:07,251 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:07,251 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:07,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:07,253 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:07,253 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:07,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:07,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:07,253 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1] [2019-08-05 10:46:07,254 INFO L418 AbstractCegarLoop]: === Iteration 199 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1792304301, now seen corresponding path program 161 times [2019-08-05 10:46:07,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:07,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:07,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:07,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:07,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:07,614 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:08,473 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:08,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:08,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:08,474 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:08,474 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:08,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:08,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:08,476 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:08,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:08,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:08,477 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-08-05 10:46:08,477 INFO L418 AbstractCegarLoop]: === Iteration 200 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash -132009707, now seen corresponding path program 162 times [2019-08-05 10:46:08,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:08,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:08,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:09,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:09,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:09,017 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:09,804 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:09,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:09,805 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:09,805 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:09,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:09,807 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:09,807 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:09,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:09,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:09,808 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-08-05 10:46:09,808 INFO L418 AbstractCegarLoop]: === Iteration 201 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash -202484845, now seen corresponding path program 163 times [2019-08-05 10:46:09,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:09,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:09,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:10,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:10,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:10,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:10,174 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:10,939 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:10,940 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:10,940 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:10,941 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:10,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:10,942 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:10,943 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:10,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:10,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:10,943 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1] [2019-08-05 10:46:10,944 INFO L418 AbstractCegarLoop]: === Iteration 202 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1907753173, now seen corresponding path program 164 times [2019-08-05 10:46:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:10,949 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:10,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:11,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:11,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:11,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:11,302 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:12,189 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:12,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:12,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:12,190 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:12,190 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:12,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:12,191 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:12,191 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:12,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:12,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:12,192 INFO L399 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1] [2019-08-05 10:46:12,192 INFO L418 AbstractCegarLoop]: === Iteration 203 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1394345005, now seen corresponding path program 165 times [2019-08-05 10:46:12,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:12,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:12,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:12,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:12,548 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:13,235 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:13,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:13,236 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:13,236 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:13,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:13,238 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:13,238 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:13,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:13,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:13,239 INFO L399 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1] [2019-08-05 10:46:13,239 INFO L418 AbstractCegarLoop]: === Iteration 204 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:13,239 INFO L82 PathProgramCache]: Analyzing trace with hash -680173419, now seen corresponding path program 166 times [2019-08-05 10:46:13,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:13,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:13,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:13,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:13,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:13,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:13,590 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:14,265 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:14,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:14,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:14,266 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:14,266 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:14,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:14,271 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:14,271 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:14,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:14,271 INFO L399 BasicCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1] [2019-08-05 10:46:14,271 INFO L418 AbstractCegarLoop]: === Iteration 205 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash -15690733, now seen corresponding path program 167 times [2019-08-05 10:46:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:14,277 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:14,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:14,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:14,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:14,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:14,665 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:15,290 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:15,291 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:15,291 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:15,291 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:15,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:15,293 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:15,293 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:15,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:15,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:15,294 INFO L399 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1] [2019-08-05 10:46:15,294 INFO L418 AbstractCegarLoop]: === Iteration 206 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:15,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:15,294 INFO L82 PathProgramCache]: Analyzing trace with hash -891563947, now seen corresponding path program 168 times [2019-08-05 10:46:15,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:15,299 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:15,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:15,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:15,794 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:16,379 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:16,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:16,380 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:16,380 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:16,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:16,382 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:16,382 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:16,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:16,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:16,383 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1] [2019-08-05 10:46:16,383 INFO L418 AbstractCegarLoop]: === Iteration 207 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2021137491, now seen corresponding path program 169 times [2019-08-05 10:46:16,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:16,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:16,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:16,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:16,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:16,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:16,761 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:17,322 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:17,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:17,322 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:17,323 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:17,323 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:17,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:17,324 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:17,325 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:17,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:17,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:17,325 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1] [2019-08-05 10:46:17,326 INFO L418 AbstractCegarLoop]: === Iteration 208 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2120568853, now seen corresponding path program 170 times [2019-08-05 10:46:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:17,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:17,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:17,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:17,698 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:18,225 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:18,225 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:18,226 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:18,226 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:18,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:18,228 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:18,228 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:18,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:18,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:18,229 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:46:18,229 INFO L418 AbstractCegarLoop]: === Iteration 209 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 907973779, now seen corresponding path program 171 times [2019-08-05 10:46:18,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:18,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:46:18,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:18,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:18,583 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,056 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-08-05 10:46:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:19,057 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,057 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:19,057 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:19,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:46:19,059 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:46:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,060 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:46:19,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:46:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:19,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,060 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 10:46:19,061 INFO L418 AbstractCegarLoop]: === Iteration 210 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1972232149, now seen corresponding path program 19 times [2019-08-05 10:46:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:19,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:19,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:19,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:19,453 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:46:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,928 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2019-08-05 10:46:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:19,929 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:46:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,929 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:46:19,929 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:46:19,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:46:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-08-05 10:46:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:46:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2019-08-05 10:46:19,931 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 23 [2019-08-05 10:46:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,931 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2019-08-05 10:46:19,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2019-08-05 10:46:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:19,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,931 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 10:46:19,931 INFO L418 AbstractCegarLoop]: === Iteration 211 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1728827238, now seen corresponding path program 20 times [2019-08-05 10:46:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:20,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:20,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:20,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:20,368 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand 25 states. [2019-08-05 10:46:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:21,643 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:21,643 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:21,644 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:21,644 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:21,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:21,646 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:21,646 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:21,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:21,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:21,647 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1] [2019-08-05 10:46:21,647 INFO L418 AbstractCegarLoop]: === Iteration 212 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:21,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1728763812, now seen corresponding path program 172 times [2019-08-05 10:46:21,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:21,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:21,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:22,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:22,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:22,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:22,139 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:23,396 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:23,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:23,397 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:23,397 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:23,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:23,399 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:23,399 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:23,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:23,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:23,400 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1] [2019-08-05 10:46:23,400 INFO L418 AbstractCegarLoop]: === Iteration 213 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:23,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1726797606, now seen corresponding path program 173 times [2019-08-05 10:46:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:23,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:23,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:23,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:23,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:23,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:23,803 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:24,929 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:24,930 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:24,930 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:24,930 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:24,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:24,932 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:24,932 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:24,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:24,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:24,933 INFO L399 BasicCegarLoop]: trace histogram [17, 3, 1, 1, 1, 1] [2019-08-05 10:46:24,933 INFO L418 AbstractCegarLoop]: === Iteration 214 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1665845220, now seen corresponding path program 174 times [2019-08-05 10:46:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:24,938 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:24,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:25,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:25,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:25,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:25,314 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,394 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:26,394 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,395 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:26,395 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:26,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:26,397 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,397 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:26,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:26,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,398 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1] [2019-08-05 10:46:26,398 INFO L418 AbstractCegarLoop]: === Iteration 215 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 223678746, now seen corresponding path program 175 times [2019-08-05 10:46:26,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,403 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:26,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:26,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:26,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:26,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:26,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:26,806 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:27,976 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:27,976 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:27,977 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:27,977 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:27,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:27,978 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:27,978 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:27,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:27,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:27,979 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 1, 1, 1, 1] [2019-08-05 10:46:27,979 INFO L418 AbstractCegarLoop]: === Iteration 216 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1330620452, now seen corresponding path program 176 times [2019-08-05 10:46:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:27,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:27,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:28,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:28,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:28,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:28,357 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:29,358 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:29,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:29,359 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:29,359 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:29,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:29,360 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:29,361 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:29,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:29,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:29,361 INFO L399 BasicCegarLoop]: trace histogram [14, 6, 1, 1, 1, 1] [2019-08-05 10:46:29,362 INFO L418 AbstractCegarLoop]: === Iteration 217 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2025711962, now seen corresponding path program 177 times [2019-08-05 10:46:29,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:29,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:29,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:29,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:29,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:29,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:29,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:29,749 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:30,738 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:30,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:30,739 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:30,739 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:30,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:30,741 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:30,741 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:30,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:30,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:30,742 INFO L399 BasicCegarLoop]: trace histogram [13, 7, 1, 1, 1, 1] [2019-08-05 10:46:30,742 INFO L418 AbstractCegarLoop]: === Iteration 218 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1302165604, now seen corresponding path program 178 times [2019-08-05 10:46:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:30,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:30,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:31,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:31,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:31,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:31,120 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:32,093 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:32,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:32,094 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:32,094 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:32,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:32,096 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:32,096 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:32,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:32,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:32,097 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 1, 1, 1, 1] [2019-08-05 10:46:32,097 INFO L418 AbstractCegarLoop]: === Iteration 219 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1387155046, now seen corresponding path program 179 times [2019-08-05 10:46:32,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:32,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:32,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:32,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:32,695 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:33,609 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:33,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:33,609 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:33,609 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:33,609 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:33,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:33,610 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:33,611 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:33,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:33,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:33,611 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 1, 1, 1, 1] [2019-08-05 10:46:33,611 INFO L418 AbstractCegarLoop]: === Iteration 220 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 273139548, now seen corresponding path program 180 times [2019-08-05 10:46:33,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:33,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:33,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:34,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:34,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:34,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:34,019 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:34,904 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:34,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:34,905 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:34,905 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:34,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:34,907 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:34,907 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:34,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:34,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:34,908 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-05 10:46:34,908 INFO L418 AbstractCegarLoop]: === Iteration 221 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash 202664410, now seen corresponding path program 181 times [2019-08-05 10:46:34,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:34,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:34,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:35,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:35,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:35,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:35,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:35,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:35,351 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:36,212 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:36,213 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:36,213 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:36,213 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:36,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:36,215 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:36,215 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:36,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:36,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:36,216 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 1, 1, 1, 1] [2019-08-05 10:46:36,216 INFO L418 AbstractCegarLoop]: === Iteration 222 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1982064868, now seen corresponding path program 182 times [2019-08-05 10:46:36,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:36,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:36,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:36,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:36,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:36,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:36,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:36,666 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:37,534 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:37,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:37,534 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:37,534 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:37,534 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:37,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:37,536 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:37,536 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:37,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:37,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:37,536 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 1, 1, 1, 1] [2019-08-05 10:46:37,536 INFO L418 AbstractCegarLoop]: === Iteration 223 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash -989195750, now seen corresponding path program 183 times [2019-08-05 10:46:37,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:37,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:37,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:38,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:38,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:38,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:38,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:38,063 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:38,859 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:38,859 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:38,859 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:38,860 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:38,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:38,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:38,861 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:38,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:38,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:38,862 INFO L399 BasicCegarLoop]: trace histogram [13, 7, 1, 1, 1, 1] [2019-08-05 10:46:38,862 INFO L418 AbstractCegarLoop]: === Iteration 224 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:38,863 INFO L82 PathProgramCache]: Analyzing trace with hash -275024164, now seen corresponding path program 184 times [2019-08-05 10:46:38,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:38,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:38,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:39,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:39,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:39,241 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:39,999 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:40,000 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:40,000 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:40,000 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:40,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:40,002 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:40,002 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:40,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:40,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:40,003 INFO L399 BasicCegarLoop]: trace histogram [14, 6, 1, 1, 1, 1] [2019-08-05 10:46:40,003 INFO L418 AbstractCegarLoop]: === Iteration 225 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash 389458522, now seen corresponding path program 185 times [2019-08-05 10:46:40,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:40,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:40,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:40,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:40,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:40,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:40,410 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:41,117 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:41,117 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:41,118 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:41,118 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:41,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:41,119 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:41,120 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:41,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:41,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:41,120 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 1, 1, 1, 1] [2019-08-05 10:46:41,120 INFO L418 AbstractCegarLoop]: === Iteration 226 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash -486414692, now seen corresponding path program 186 times [2019-08-05 10:46:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:41,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:41,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:41,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:41,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:41,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:41,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:41,524 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:42,190 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:42,191 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:42,191 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:42,191 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:42,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:42,193 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:42,193 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:42,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:42,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:42,193 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1] [2019-08-05 10:46:42,194 INFO L418 AbstractCegarLoop]: === Iteration 227 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1868680550, now seen corresponding path program 187 times [2019-08-05 10:46:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:42,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:42,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:42,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:42,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:42,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:42,612 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:43,327 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:43,327 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:43,328 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:43,328 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:43,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:43,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:43,330 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:43,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:43,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:43,330 INFO L399 BasicCegarLoop]: trace histogram [17, 3, 1, 1, 1, 1] [2019-08-05 10:46:43,330 INFO L418 AbstractCegarLoop]: === Iteration 228 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1769249188, now seen corresponding path program 188 times [2019-08-05 10:46:43,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:43,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:43,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:43,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:43,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:43,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:43,711 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:44,318 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:44,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:44,318 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:44,319 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:44,319 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:44,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:44,321 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:44,321 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:44,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:44,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:44,322 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1] [2019-08-05 10:46:44,322 INFO L418 AbstractCegarLoop]: === Iteration 229 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1313123034, now seen corresponding path program 189 times [2019-08-05 10:46:44,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:44,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:44,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:44,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:44,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:44,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:44,707 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:45,277 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:45,278 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:45,278 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:45,279 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:45,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:45,280 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:45,281 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:45,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:45,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:45,281 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1] [2019-08-05 10:46:45,281 INFO L418 AbstractCegarLoop]: === Iteration 230 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:45,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1917585892, now seen corresponding path program 190 times [2019-08-05 10:46:45,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:45,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:46:45,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:45,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:45,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:45,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:45,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:45,698 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:46,212 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-08-05 10:46:46,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:46,212 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:46,213 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:46,213 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:46,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-08-05 10:46:46,214 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 24 [2019-08-05 10:46:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:46,215 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-08-05 10:46:46,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-08-05 10:46:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:46,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:46,215 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 10:46:46,216 INFO L418 AbstractCegarLoop]: === Iteration 231 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1009652506, now seen corresponding path program 20 times [2019-08-05 10:46:46,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:46,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:46:46,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:46,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:46,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:46,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:46,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:46,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:46,649 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 25 states. [2019-08-05 10:46:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:47,176 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2019-08-05 10:46:47,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:47,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:46:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:47,177 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:46:47,177 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:46:47,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:46:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:46:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2019-08-05 10:46:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:46:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2019-08-05 10:46:47,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 24 [2019-08-05 10:46:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:47,179 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2019-08-05 10:46:47,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2019-08-05 10:46:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:47,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:47,179 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 10:46:47,180 INFO L418 AbstractCegarLoop]: === Iteration 232 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2054102221, now seen corresponding path program 21 times [2019-08-05 10:46:47,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:47,186 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:46:47,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:47,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:47,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:47,702 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand 26 states. [2019-08-05 10:46:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:49,160 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:49,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:49,161 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:49,161 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:49,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:49,163 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:49,163 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:49,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:49,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:49,163 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1] [2019-08-05 10:46:49,164 INFO L418 AbstractCegarLoop]: === Iteration 233 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2054038795, now seen corresponding path program 191 times [2019-08-05 10:46:49,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:49,171 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:49,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:49,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:49,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:49,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:49,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:49,678 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:46:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:50,917 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:50,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:50,918 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:50,918 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:50,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:50,920 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:50,920 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:50,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:50,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:50,921 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1] [2019-08-05 10:46:50,922 INFO L418 AbstractCegarLoop]: === Iteration 234 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2052072589, now seen corresponding path program 192 times [2019-08-05 10:46:50,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:50,928 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:50,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:51,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:51,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:51,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:51,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:51,343 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:46:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:52,567 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:52,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:52,568 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:52,568 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:52,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:52,570 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:52,570 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:52,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:52,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:52,571 INFO L399 BasicCegarLoop]: trace histogram [18, 3, 1, 1, 1, 1] [2019-08-05 10:46:52,571 INFO L418 AbstractCegarLoop]: === Iteration 235 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:52,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1991120203, now seen corresponding path program 193 times [2019-08-05 10:46:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:52,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:52,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:53,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:53,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:53,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:53,132 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:46:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:54,340 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:54,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:54,341 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:54,341 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:54,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:54,343 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:54,343 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:54,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:54,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:54,344 INFO L399 BasicCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1] [2019-08-05 10:46:54,344 INFO L418 AbstractCegarLoop]: === Iteration 236 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash -101596237, now seen corresponding path program 194 times [2019-08-05 10:46:54,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:54,350 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:54,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:55,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:55,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:55,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:55,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:55,011 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:46:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:56,155 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:56,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:56,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:56,156 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:56,156 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:56,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:56,157 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:56,158 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:56,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:56,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:56,158 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 1, 1, 1, 1] [2019-08-05 10:46:56,159 INFO L418 AbstractCegarLoop]: === Iteration 237 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1655895435, now seen corresponding path program 195 times [2019-08-05 10:46:56,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:56,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:56,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:56,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:56,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:56,565 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:46:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:57,686 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:57,686 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:57,687 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:57,687 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:57,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:57,689 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:57,690 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:57,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:57,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:57,690 INFO L399 BasicCegarLoop]: trace histogram [15, 6, 1, 1, 1, 1] [2019-08-05 10:46:57,691 INFO L418 AbstractCegarLoop]: === Iteration 238 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1700436979, now seen corresponding path program 196 times [2019-08-05 10:46:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:57,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:57,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:58,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:58,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:46:58,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:46:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:46:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:58,500 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:46:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:59,602 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:46:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:46:59,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:46:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:59,603 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:59,603 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:59,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:46:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:46:59,605 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:46:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:59,605 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:46:59,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:46:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:46:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:59,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:59,606 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1] [2019-08-05 10:46:59,606 INFO L418 AbstractCegarLoop]: === Iteration 239 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:46:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1627440587, now seen corresponding path program 197 times [2019-08-05 10:46:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:59,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:46:59,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:00,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:00,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:00,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:00,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:00,016 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:01,050 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:01,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:01,051 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:01,052 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:01,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:01,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:01,054 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:01,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:01,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:01,055 INFO L399 BasicCegarLoop]: trace histogram [13, 8, 1, 1, 1, 1] [2019-08-05 10:47:01,055 INFO L418 AbstractCegarLoop]: === Iteration 240 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1712430029, now seen corresponding path program 198 times [2019-08-05 10:47:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:01,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:01,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:01,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:01,555 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:02,563 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:02,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:02,564 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:02,564 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:02,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:02,566 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:02,567 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:02,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:02,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:02,568 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 1, 1, 1, 1] [2019-08-05 10:47:02,568 INFO L418 AbstractCegarLoop]: === Iteration 241 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash -52135435, now seen corresponding path program 199 times [2019-08-05 10:47:02,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:02,573 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:02,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:02,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:02,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:02,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:02,978 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,079 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:04,079 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,080 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:04,080 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:04,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:04,082 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,082 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:04,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:04,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,083 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2019-08-05 10:47:04,083 INFO L418 AbstractCegarLoop]: === Iteration 242 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash -122610573, now seen corresponding path program 200 times [2019-08-05 10:47:04,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:04,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:04,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:04,511 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:05,464 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:05,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:05,465 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:05,465 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:05,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:05,467 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:05,467 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:05,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:05,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:05,468 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2019-08-05 10:47:05,468 INFO L418 AbstractCegarLoop]: === Iteration 243 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1987627445, now seen corresponding path program 201 times [2019-08-05 10:47:05,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:05,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:05,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:05,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:05,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:05,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:05,883 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:06,781 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:06,782 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:06,782 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:06,783 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:06,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:06,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:06,784 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:06,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:06,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:06,785 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 1, 1, 1, 1] [2019-08-05 10:47:06,785 INFO L418 AbstractCegarLoop]: === Iteration 244 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1314470733, now seen corresponding path program 202 times [2019-08-05 10:47:06,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:06,791 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:06,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:07,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:07,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:07,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:07,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:07,194 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:08,065 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:08,070 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:08,070 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:08,070 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:08,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:08,071 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:08,071 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:08,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:08,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:08,072 INFO L399 BasicCegarLoop]: trace histogram [13, 8, 1, 1, 1, 1] [2019-08-05 10:47:08,072 INFO L418 AbstractCegarLoop]: === Iteration 245 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:08,072 INFO L82 PathProgramCache]: Analyzing trace with hash -600299147, now seen corresponding path program 203 times [2019-08-05 10:47:08,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:08,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:08,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:08,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:08,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:08,786 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,624 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:09,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:09,624 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,625 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:09,625 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:09,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:09,627 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,627 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:09,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:09,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,627 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1] [2019-08-05 10:47:09,627 INFO L418 AbstractCegarLoop]: === Iteration 246 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash 64183539, now seen corresponding path program 204 times [2019-08-05 10:47:09,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,632 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:10,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:10,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:10,035 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,849 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:10,849 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,850 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:10,850 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:10,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:10,851 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,852 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:10,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:10,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,852 INFO L399 BasicCegarLoop]: trace histogram [15, 6, 1, 1, 1, 1] [2019-08-05 10:47:10,852 INFO L418 AbstractCegarLoop]: === Iteration 247 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash -811689675, now seen corresponding path program 205 times [2019-08-05 10:47:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:11,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:11,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:11,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:11,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:11,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:11,260 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:12,002 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:12,003 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:12,003 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:12,003 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:12,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:12,005 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:12,005 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:12,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:12,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:12,006 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 1, 1, 1, 1] [2019-08-05 10:47:12,006 INFO L418 AbstractCegarLoop]: === Iteration 248 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2101011763, now seen corresponding path program 206 times [2019-08-05 10:47:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:12,012 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:12,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:12,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:12,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:12,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:12,414 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:13,139 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:13,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:13,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:13,140 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:13,140 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:13,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:13,142 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:13,142 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:13,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:13,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:13,142 INFO L399 BasicCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1] [2019-08-05 10:47:13,143 INFO L418 AbstractCegarLoop]: === Iteration 249 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2094524171, now seen corresponding path program 207 times [2019-08-05 10:47:13,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:13,148 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:13,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:13,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:13,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:13,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:13,668 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:14,346 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:14,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:14,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:14,347 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:14,347 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:14,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:14,348 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:14,349 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:14,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:14,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:14,349 INFO L399 BasicCegarLoop]: trace histogram [18, 3, 1, 1, 1, 1] [2019-08-05 10:47:14,350 INFO L418 AbstractCegarLoop]: === Iteration 250 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:14,350 INFO L82 PathProgramCache]: Analyzing trace with hash 987848051, now seen corresponding path program 208 times [2019-08-05 10:47:14,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:14,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:14,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:14,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:14,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:14,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:14,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:14,758 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:15,404 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:15,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:15,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:15,405 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:15,405 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:15,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:15,406 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:15,407 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:15,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:15,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:15,407 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1] [2019-08-05 10:47:15,407 INFO L418 AbstractCegarLoop]: === Iteration 251 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2052106421, now seen corresponding path program 209 times [2019-08-05 10:47:15,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:15,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:15,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:15,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:15,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:15,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:15,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:15,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:15,876 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:16,485 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:16,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:16,485 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:16,486 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:16,486 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:16,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:16,488 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:16,488 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:16,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:16,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:16,488 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1] [2019-08-05 10:47:16,488 INFO L418 AbstractCegarLoop]: === Iteration 252 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 684377523, now seen corresponding path program 210 times [2019-08-05 10:47:16,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:16,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:16,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:16,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:16,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:16,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:16,902 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:17,464 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2019-08-05 10:47:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:17,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:17,465 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:17,465 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:17,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-08-05 10:47:17,467 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 25 [2019-08-05 10:47:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:17,467 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-08-05 10:47:17,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-08-05 10:47:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:17,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:17,468 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 10:47:17,468 INFO L418 AbstractCegarLoop]: === Iteration 253 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1234454645, now seen corresponding path program 21 times [2019-08-05 10:47:17,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:17,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:47:17,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:17,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:17,956 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 26 states. [2019-08-05 10:47:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:18,654 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2019-08-05 10:47:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:18,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:47:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:18,655 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:47:18,655 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:47:18,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:47:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2019-08-05 10:47:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:47:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2019-08-05 10:47:18,657 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 25 [2019-08-05 10:47:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:18,657 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2019-08-05 10:47:18,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2019-08-05 10:47:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:18,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:18,657 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 10:47:18,658 INFO L418 AbstractCegarLoop]: === Iteration 254 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:18,658 INFO L82 PathProgramCache]: Analyzing trace with hash 747275194, now seen corresponding path program 22 times [2019-08-05 10:47:18,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:18,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:47:18,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:19,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:19,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:19,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:19,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:19,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:19,147 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 27 states. [2019-08-05 10:47:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:20,638 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2019-08-05 10:47:20,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:20,638 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:47:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:20,638 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:20,639 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:20,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2019-08-05 10:47:20,641 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 26 [2019-08-05 10:47:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:20,641 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2019-08-05 10:47:20,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2019-08-05 10:47:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:20,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:20,642 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1] [2019-08-05 10:47:20,643 INFO L418 AbstractCegarLoop]: === Iteration 255 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:20,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash 747338620, now seen corresponding path program 211 times [2019-08-05 10:47:20,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:20,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:47:20,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:21,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:21,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:21,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:21,108 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 27 states. [2019-08-05 10:47:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:22,488 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2019-08-05 10:47:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:22,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:47:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:22,489 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:22,489 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:22,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2019-08-05 10:47:22,491 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 26 [2019-08-05 10:47:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:22,491 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2019-08-05 10:47:22,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2019-08-05 10:47:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:22,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:22,492 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1] [2019-08-05 10:47:22,492 INFO L418 AbstractCegarLoop]: === Iteration 256 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash 749304826, now seen corresponding path program 212 times [2019-08-05 10:47:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:22,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:47:22,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:22,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:22,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:22,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:22,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:22,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:22,965 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 27 states. [2019-08-05 10:47:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:24,428 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2019-08-05 10:47:24,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:24,431 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:47:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:24,431 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:24,431 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:24,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2019-08-05 10:47:24,433 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 26 [2019-08-05 10:47:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:24,433 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2019-08-05 10:47:24,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2019-08-05 10:47:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:24,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:24,434 INFO L399 BasicCegarLoop]: trace histogram [19, 3, 1, 1, 1, 1] [2019-08-05 10:47:24,434 INFO L418 AbstractCegarLoop]: === Iteration 257 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 810257212, now seen corresponding path program 213 times [2019-08-05 10:47:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:24,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:47:24,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:24,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:24,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:24,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:24,929 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 27 states. [2019-08-05 10:47:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:26,223 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2019-08-05 10:47:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:26,224 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:47:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:26,225 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:26,225 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:26,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2019-08-05 10:47:26,227 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 26 [2019-08-05 10:47:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:26,227 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2019-08-05 10:47:26,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2019-08-05 10:47:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:26,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:26,228 INFO L399 BasicCegarLoop]: trace histogram [18, 4, 1, 1, 1, 1] [2019-08-05 10:47:26,228 INFO L418 AbstractCegarLoop]: === Iteration 258 === [StepwiseAdditionErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:47:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1595186118, now seen corresponding path program 214 times [2019-08-05 10:47:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:26,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:47:26,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:26,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:26,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:26,662 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 27 states. Received shutdown request... [2019-08-05 10:47:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:47:27,452 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:47:27,459 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:47:27,459 INFO L202 PluginConnector]: Adding new model StepwiseAddition.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:27 BoogieIcfgContainer [2019-08-05 10:47:27,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:27,463 INFO L168 Benchmark]: Toolchain (without parser) took 244457.77 ms. Allocated memory was 138.9 MB in the beginning and 137.9 MB in the end (delta: -1.0 MB). Free memory was 108.7 MB in the beginning and 48.7 MB in the end (delta: 60.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:27,463 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:27,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 138.9 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:27,464 INFO L168 Benchmark]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 138.9 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:27,464 INFO L168 Benchmark]: RCFGBuilder took 235.06 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 95.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:27,464 INFO L168 Benchmark]: TraceAbstraction took 244152.51 ms. Allocated memory was 138.9 MB in the beginning and 137.9 MB in the end (delta: -1.0 MB). Free memory was 95.5 MB in the beginning and 48.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:27,466 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 138.9 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 138.9 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 235.06 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 95.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244152.51 ms. Allocated memory was 138.9 MB in the beginning and 137.9 MB in the end (delta: -1.0 MB). Free memory was 95.5 MB in the beginning and 48.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that procedure postcondition always holds (line 11). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and FLOYD_HOARE automaton (currently 17 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 244.0s OverallTime, 258 OverallIterations, 22 TraceHistogramMax, 150.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 515 SDtfs, 2407 SDslu, 279 SDs, 0 SdLazy, 170238 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 117.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4940 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 98.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=254, 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.4s AutomataMinimizationTime, 257 MinimizatonAttempts, 3630 StatesRemovedByMinimization, 256 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 91.0s InterpolantComputationTime, 4684 NumberOfCodeBlocks, 4684 NumberOfCodeBlocksAsserted, 258 NumberOfCheckSat, 4426 ConstructedInterpolants, 0 QuantifiedInterpolants, 1004601 SizeOfPredicates, 516 NumberOfNonLiveVariables, 22130 ConjunctsInSsa, 17401 ConjunctsInUnsatCore, 258 InterpolantComputations, 1 PerfectInterpolantSequences, 0/22327 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown