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/20181015-LoopsPathprograms/ddlm2013_true-unreach-call.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:26:21,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:26:21,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:26:21,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:26:21,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:26:21,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:26:21,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:26:21,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:26:21,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:26:21,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:26:21,114 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:26:21,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:26:21,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:26:21,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:26:21,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:26:21,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:26:21,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:26:21,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:26:21,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:26:21,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:26:21,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:26:21,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:26:21,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:26:21,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:26:21,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:26:21,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:26:21,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:26:21,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:26:21,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:26:21,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:26:21,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:26:21,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:26:21,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:26:21,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:26:21,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:26:21,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:26:21,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:26:21,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:26:21,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:26:21,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:26:21,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:26:21,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:26:21,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:26:21,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:26:21,208 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:26:21,209 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:26:21,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/ddlm2013_true-unreach-call.i_3.bpl [2019-08-05 10:26:21,210 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/ddlm2013_true-unreach-call.i_3.bpl' [2019-08-05 10:26:21,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:26:21,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:26:21,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:21,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:26:21,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:26:21,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:21,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:26:21,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:26:21,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:26:21,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/1) ... [2019-08-05 10:26:21,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:26:21,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:26:21,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:26:21,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:26:21,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (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:26:21,374 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:26:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:26:21,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:26:21,620 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:26:21,621 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:26:21,622 INFO L202 PluginConnector]: Adding new model ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:21 BoogieIcfgContainer [2019-08-05 10:26:21,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:26:21,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:26:21,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:26:21,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:26:21,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:21" (1/2) ... [2019-08-05 10:26:21,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3878361 and model type ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:26:21, skipping insertion in model container [2019-08-05 10:26:21,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:21" (2/2) ... [2019-08-05 10:26:21,634 INFO L109 eAbstractionObserver]: Analyzing ICFG ddlm2013_true-unreach-call.i_3.bpl [2019-08-05 10:26:21,644 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:26:21,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:26:21,666 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:26:21,689 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:26:21,690 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:26:21,690 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:26:21,690 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:26:21,691 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:26:21,691 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:26:21,691 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:26:21,691 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:26:21,691 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:26:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:26:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:26:21,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:21,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:26:21,718 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 10:26:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:21,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:26:21,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:21,925 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:26:21,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:26:21,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:21,957 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:26:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:22,020 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:26:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:22,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:26:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:22,033 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:22,033 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:22,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:26:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:26:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:26:22,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:26:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:22,076 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:26:22,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:26:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:26:22,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:22,078 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:26:22,079 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 10:26:22,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:22,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:26:22,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:22,254 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:26:22,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:22,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:26:22,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:22,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:22,258 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 10:26:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:22,333 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:26:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:22,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:26:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:22,334 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:26:22,334 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:26:22,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:26:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:26:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:26:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:26:22,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:26:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:22,338 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:26:22,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:26:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:26:22,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:22,339 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:26:22,340 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 10:26:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:22,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:26:22,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:22,581 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:26:22,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:22,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:22,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:22,583 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:26:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:22,649 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:26:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:22,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:26:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:22,656 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:22,657 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:26:22,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:26:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:26:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:26:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:26:22,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:26:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:22,671 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:26:22,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:26:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:26:22,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:22,672 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:26:22,673 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 10:26:22,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:22,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:26:22,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:22,864 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:23,137 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:26:23,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:23,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:23,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:23,139 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2019-08-05 10:26:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:23,196 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:26:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:23,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:26:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:23,198 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:26:23,199 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:26:23,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:26:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:26:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:26:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:26:23,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:26:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:23,203 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:26:23,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:26:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:26:23,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:23,204 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:26:23,204 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:23,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 10:26:23,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:23,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:26:23,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:23,504 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:26:23,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:23,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:23,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:23,506 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2019-08-05 10:26:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:23,705 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:26:23,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:23,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:26:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:23,707 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:26:23,707 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:26:23,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:26:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:26:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:26:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:26:23,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:26:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:23,712 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:26:23,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:26:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:26:23,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:23,713 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:26:23,713 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 10:26:23,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:23,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:26:23,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:24,158 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:26:24,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:24,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:24,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:24,160 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-08-05 10:26:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:24,368 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:26:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:24,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 10:26:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:24,370 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:26:24,370 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:26:24,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:26:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:26:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:26:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:26:24,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:26:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:24,374 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:26:24,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:26:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:26:24,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:24,375 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:26:24,375 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 10:26:24,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:24,431 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:26:24,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:24,583 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:24,797 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:26:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:24,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:24,799 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2019-08-05 10:26:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:24,934 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:26:24,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:24,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 10:26:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:24,938 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:26:24,938 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:26:24,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:26:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:26:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:26:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:26:24,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:26:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:24,943 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:26:24,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:26:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:26:24,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:24,944 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:26:24,944 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 10:26:24,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:25,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:26:25,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:25,176 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:25,363 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:25,561 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:25,771 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:25,930 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:26:25,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:25,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:25,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:25,931 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-08-05 10:26:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:26,042 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:26:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:26,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-05 10:26:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:26,044 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:26:26,044 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:26:26,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:26:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:26:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:26:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:26:26,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:26:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:26,047 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:26:26,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:26:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:26:26,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:26,048 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:26:26,049 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 10:26:26,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:26,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:26:26,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:26,464 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:26:26,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:26,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:26,465 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2019-08-05 10:26:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:26,579 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:26:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:26,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 10:26:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:26,581 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:26:26,581 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:26:26,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:26:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:26:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:26:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:26:26,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:26:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:26,586 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:26:26,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:26:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:26:26,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:26,587 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:26:26,588 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 10:26:26,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:26,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:26:26,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:26,786 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:27,117 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:26:27,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:27,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:27,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:27,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:27,119 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2019-08-05 10:26:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:27,315 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:26:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:27,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 10:26:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:27,317 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:26:27,317 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:26:27,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:26:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:26:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:26:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:26:27,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:26:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:27,323 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:26:27,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:26:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:26:27,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:27,323 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:26:27,324 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 10:26:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:27,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:26:27,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:27,797 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:26:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:27,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:26:27,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:26:27,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:26:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:27,799 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-08-05 10:26:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:28,027 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:26:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:26:28,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 10:26:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:28,029 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:26:28,029 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:26:28,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:26:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:26:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:26:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:26:28,033 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:26:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:28,034 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:26:28,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:26:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:26:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:26:28,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:28,035 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:26:28,035 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 10:26:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:28,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:26:28,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:28,236 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:28,407 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:26:28,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:26:28,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:26:28,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:28,658 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-08-05 10:26:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:28,841 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:26:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:26:28,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-05 10:26:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:28,842 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:26:28,843 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:26:28,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:26:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:26:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:26:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:26:28,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:26:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:28,848 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:26:28,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:26:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:26:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:26:28,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:28,849 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:26:28,850 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 10:26:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:28,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:26:28,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:29,044 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:29,193 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:29,612 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:26:29,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:29,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:26:29,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:26:29,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:26:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:29,614 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-08-05 10:26:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:29,855 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:26:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:26:29,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-05 10:26:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:29,857 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:26:29,857 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:26:29,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:26:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:26:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:26:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:26:29,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:26:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:29,861 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:26:29,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:26:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:26:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:26:29,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:29,863 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:26:29,863 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 10:26:29,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:29,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:26:29,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:30,087 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:30,258 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:30,464 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:30,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:26:30,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:26:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:26:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:30,784 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-08-05 10:26:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:31,281 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:26:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:26:31,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-05 10:26:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:31,283 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:26:31,283 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:26:31,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:26:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:26:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:26:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:26:31,289 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:26:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:31,289 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:26:31,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:26:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:26:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:26:31,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:31,290 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:26:31,291 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 10:26:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:31,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:26:31,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,506 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:31,664 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:31,854 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:32,328 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:26:32,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:32,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:26:32,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:26:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:26:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:32,330 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2019-08-05 10:26:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,624 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:26:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:26:32,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-05 10:26:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,625 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:26:32,626 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:26:32,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:26:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:26:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:26:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:26:32,630 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:26:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,630 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:26:32,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:26:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:26:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:26:32,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,631 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:26:32,631 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 10:26:32,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,717 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:32,850 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:33,017 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:33,207 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:26:33,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:26:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:26:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:33,646 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2019-08-05 10:26:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:34,075 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:26:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:26:34,076 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-05 10:26:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:34,077 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:26:34,077 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:26:34,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:26:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:26:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:26:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:26:34,083 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:26:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:34,083 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:26:34,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:26:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:26:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:26:34,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:34,085 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:26:34,085 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 10:26:34,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:34,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:26:34,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:34,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:34,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:26:34,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:26:34,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:26:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:34,757 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2019-08-05 10:26:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:35,307 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:26:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:26:35,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-05 10:26:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:35,308 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:26:35,308 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:26:35,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:26:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:26:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:26:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:26:35,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:26:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:26:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:26:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:26:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:26:35,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:35,316 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:26:35,317 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 10:26:35,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:35,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:26:35,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:35,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:35,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:26:35,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:26:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:26:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:35,826 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2019-08-05 10:26:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:36,290 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:26:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:26:36,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-05 10:26:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:36,291 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:26:36,292 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:26:36,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:26:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:26:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:26:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:26:36,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:26:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:36,296 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:26:36,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:26:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:26:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:26:36,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:36,297 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:26:36,297 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 10:26:36,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:36,368 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:26:36,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:36,762 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:37,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:37,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:26:37,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:26:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:26:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:37,043 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2019-08-05 10:26:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:37,824 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:26:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:26:37,825 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-05 10:26:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:37,825 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:26:37,826 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:26:37,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:26:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:26:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:26:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:26:37,830 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:26:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:37,830 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:26:37,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:26:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:26:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:26:37,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:37,832 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:26:37,832 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:37,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 10:26:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:37,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:26:37,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:38,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:38,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:26:38,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:26:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:26:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:38,401 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2019-08-05 10:26:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:38,854 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:26:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:26:38,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-05 10:26:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:38,855 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:26:38,855 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:26:38,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:26:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:26:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:26:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:26:38,861 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:26:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:38,861 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:26:38,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:26:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:26:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:26:38,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:38,862 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:26:38,863 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:38,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 10:26:38,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:38,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:26:38,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:39,110 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:39,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:39,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:26:39,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:26:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:26:39,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:39,865 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2019-08-05 10:26:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:40,346 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:26:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:26:40,347 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-05 10:26:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:40,348 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:26:40,348 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:26:40,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:26:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:26:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:26:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:26:40,352 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:26:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:40,352 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:26:40,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:26:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:26:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:26:40,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:40,353 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:26:40,354 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 10:26:40,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:40,451 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-05 10:26:40,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,603 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:40,783 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:40,967 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:41,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:41,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:26:41,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:26:41,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:26:41,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:41,352 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2019-08-05 10:26:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,884 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:26:41,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:26:41,887 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-05 10:26:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,888 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:26:41,888 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:26:41,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:26:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:26:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:26:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:26:41,893 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:26:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,893 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:26:41,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:26:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:26:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:26:41,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,894 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:26:41,894 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 10:26:41,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 184 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,160 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:42,318 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:42,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:42,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:26:42,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:26:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:26:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:42,905 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2019-08-05 10:26:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,461 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:26:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:26:43,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-05 10:26:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,463 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:26:43,463 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:26:43,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:26:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:26:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:26:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:26:43,467 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:26:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,467 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:26:43,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:26:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:26:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:26:43,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,468 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:26:43,468 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,469 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 10:26:43,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:26:44,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:26:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:26:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:44,098 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2019-08-05 10:26:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:44,771 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:26:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:26:44,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-05 10:26:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:44,773 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:26:44,773 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:26:44,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:26:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:26:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:26:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:26:44,777 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:26:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:44,777 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:26:44,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:26:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:26:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:26:44,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:44,778 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:26:44,778 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 10:26:44,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:44,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-05 10:26:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,027 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:26:45,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:26:45,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:26:45,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:45,613 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2019-08-05 10:26:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,305 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:26:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:26:46,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 10:26:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,307 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:26:46,307 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:26:46,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:26:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:26:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:26:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:26:46,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:26:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,312 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:26:46,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:26:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:26:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:26:46,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,313 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:26:46,313 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 10:26:46,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,431 WARN L254 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 208 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,572 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:47,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:47,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:26:47,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:26:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:26:47,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:47,457 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2019-08-05 10:26:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:48,151 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:26:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:26:48,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-05 10:26:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:48,153 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:26:48,153 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:26:48,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:26:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:26:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:26:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:26:48,157 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:26:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:48,157 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:26:48,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:26:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:26:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:26:48,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:48,158 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:26:48,158 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 10:26:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:49,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:26:49,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:26:49,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:26:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:49,047 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2019-08-05 10:26:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:49,866 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:26:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:26:49,866 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-05 10:26:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:49,867 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:26:49,867 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:26:49,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:26:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:26:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:26:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:26:49,871 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:26:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:49,871 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:26:49,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:26:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:26:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:26:49,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:49,872 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:26:49,872 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 10:26:49,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,052 WARN L254 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 224 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:50,183 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:26:50,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:26:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:26:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:50,925 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2019-08-05 10:26:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:51,748 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:26:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:26:51,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-05 10:26:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:51,749 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:26:51,750 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:26:51,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:26:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:26:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:26:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:26:51,753 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:26:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:51,754 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:26:51,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:26:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:26:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:26:51,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:51,755 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:26:51,755 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 10:26:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:51,898 WARN L254 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 232 conjunts are in the unsatisfiable core [2019-08-05 10:26:51,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:26:52,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:26:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:26:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:52,578 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2019-08-05 10:26:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,464 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:26:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:26:53,465 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-05 10:26:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,466 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:26:53,466 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:26:53,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:26:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:26:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:26:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:26:53,470 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:26:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,470 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:26:53,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:26:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:26:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:26:53,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,471 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:26:53,471 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 10:26:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:53,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:26:53,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:54,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:54,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:26:54,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:26:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:26:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:54,369 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2019-08-05 10:26:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:55,342 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:26:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:26:55,343 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-05 10:26:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:55,344 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:26:55,344 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:26:55,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:26:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:26:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:26:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:26:55,347 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:26:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:55,348 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:26:55,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:26:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:26:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:26:55,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:55,348 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:26:55,349 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 10:26:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:55,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 248 conjunts are in the unsatisfiable core [2019-08-05 10:26:55,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:55,711 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:55,885 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:56,079 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:26:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:56,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:56,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:26:56,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:26:56,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:26:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:56,811 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2019-08-05 10:26:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:57,808 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:26:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:26:57,808 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-05 10:26:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:57,809 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:26:57,810 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:26:57,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:26:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:26:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:26:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:26:57,813 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:26:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:57,813 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:26:57,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:26:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:26:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:26:57,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:57,814 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:26:57,814 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:57,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 10:26:57,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:58,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 256 conjunts are in the unsatisfiable core [2019-08-05 10:26:58,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:58,160 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:26:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:58,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:58,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:26:58,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:26:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:26:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:58,934 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2019-08-05 10:27:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:00,004 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:27:00,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:27:00,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-05 10:27:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:00,005 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:27:00,005 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:27:00,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:27:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:27:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:27:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:27:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:27:00,009 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:27:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:00,009 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:27:00,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:27:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:27:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:27:00,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:00,010 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:27:00,010 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 10:27:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:00,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:27:00,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:00,381 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:27:00,545 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:27:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:01,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:27:01,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:27:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:27:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:27:01,596 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2019-08-05 10:27:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:02,724 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:27:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:27:02,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-05 10:27:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:02,725 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:27:02,725 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:27:02,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:27:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:27:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:27:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:27:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:27:02,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:27:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:02,730 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:27:02,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:27:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:27:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:27:02,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:02,731 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:27:02,731 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 10:27:02,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:02,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 272 conjunts are in the unsatisfiable core [2019-08-05 10:27:02,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:03,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:27:03,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:27:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:27:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:27:03,847 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2019-08-05 10:27:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:05,087 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:27:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:27:05,087 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-05 10:27:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:05,088 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:27:05,088 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:27:05,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:27:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:27:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:27:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:27:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:27:05,093 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:27:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:05,093 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:27:05,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:27:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:27:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:27:05,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:05,094 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:27:05,094 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 10:27:05,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:05,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 280 conjunts are in the unsatisfiable core [2019-08-05 10:27:05,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:06,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:06,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:27:06,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:27:06,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:27:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:27:06,231 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2019-08-05 10:27:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:07,508 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:27:07,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:27:07,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-05 10:27:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:07,514 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:27:07,514 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:27:07,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:27:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:27:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:27:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:27:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:27:07,516 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:27:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:07,516 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:27:07,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:27:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:27:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:27:07,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:07,517 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:27:07,517 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 10:27:07,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:07,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:27:07,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:08,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:08,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:27:08,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:27:08,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:27:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:08,722 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2019-08-05 10:27:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:10,078 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:27:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:27:10,078 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-05 10:27:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:10,078 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:27:10,079 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:27:10,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:27:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:27:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:27:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:27:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:27:10,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:27:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:10,081 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:27:10,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:27:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:27:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:27:10,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:10,082 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:27:10,082 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 10:27:10,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:10,308 WARN L254 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 296 conjunts are in the unsatisfiable core [2019-08-05 10:27:10,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:11,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:11,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:27:11,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:27:11,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:27:11,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:11,324 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2019-08-05 10:27:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:12,699 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:27:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:27:12,700 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-05 10:27:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:12,701 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:27:12,701 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:27:12,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:27:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:27:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:27:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:27:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:27:12,704 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:27:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:12,704 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:27:12,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:27:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:27:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:27:12,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:12,705 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:27:12,705 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 10:27:12,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:12,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 304 conjunts are in the unsatisfiable core [2019-08-05 10:27:12,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:13,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:13,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:27:13,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:27:13,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:27:13,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:13,931 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2019-08-05 10:27:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:15,434 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:27:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:27:15,434 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-05 10:27:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:15,434 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:27:15,435 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:27:15,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:27:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:27:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:27:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:27:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:27:15,437 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:27:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:15,437 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:27:15,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:27:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:27:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:27:15,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:15,438 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:27:15,438 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 10:27:15,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:15,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 312 conjunts are in the unsatisfiable core [2019-08-05 10:27:15,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:16,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:16,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:27:16,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:27:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:27:16,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:16,797 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2019-08-05 10:27:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:18,357 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:27:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:27:18,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-05 10:27:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:18,358 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:27:18,359 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:27:18,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:27:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:27:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:27:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:27:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:27:18,362 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:27:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:18,362 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:27:18,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:27:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:27:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:27:18,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:18,362 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:27:18,363 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:18,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 10:27:18,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:18,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 320 conjunts are in the unsatisfiable core [2019-08-05 10:27:18,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:19,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:27:19,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:27:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:27:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:19,811 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2019-08-05 10:27:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:21,519 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:27:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:27:21,520 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-05 10:27:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:21,521 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:27:21,521 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:27:21,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:27:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:27:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:27:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:27:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:27:21,525 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:27:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:21,526 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:27:21,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:27:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:27:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:27:21,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:21,526 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:27:21,527 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 10:27:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:21,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 328 conjunts are in the unsatisfiable core [2019-08-05 10:27:21,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:22,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:22,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:27:22,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:27:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:27:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:22,836 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2019-08-05 10:27:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:24,595 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:27:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:27:24,595 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-05 10:27:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:24,596 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:27:24,596 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:27:24,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:27:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:27:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:27:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:27:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:27:24,600 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:27:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:24,601 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:27:24,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:27:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:27:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:27:24,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:24,602 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:27:24,602 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 10:27:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:24,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 336 conjunts are in the unsatisfiable core [2019-08-05 10:27:24,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:26,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:26,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:27:26,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:27:26,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:27:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:27:26,426 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2019-08-05 10:27:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:28,204 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:27:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:27:28,204 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-05 10:27:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:28,205 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:27:28,205 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:27:28,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:27:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:27:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:27:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:27:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:27:28,209 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:27:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:28,209 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:27:28,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:27:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:27:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:27:28,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:28,210 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:27:28,210 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 10:27:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:28,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 344 conjunts are in the unsatisfiable core [2019-08-05 10:27:28,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:30,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:27:30,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:27:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:27:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:27:30,038 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2019-08-05 10:27:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:32,056 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:27:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:27:32,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-05 10:27:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:32,057 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:27:32,057 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:27:32,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:27:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:27:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:27:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:27:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:27:32,062 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:27:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:32,062 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:27:32,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:27:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:27:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:27:32,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:32,063 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:27:32,063 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 10:27:32,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:32,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 352 conjunts are in the unsatisfiable core [2019-08-05 10:27:32,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:33,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:27:33,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:27:33,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:27:33,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:33,589 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2019-08-05 10:27:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:35,576 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:27:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:27:35,577 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-05 10:27:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:35,578 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:27:35,578 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:27:35,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:27:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:27:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:27:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:27:35,581 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:27:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:35,581 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:27:35,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:27:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:27:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:27:35,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:35,582 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:27:35,582 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 10:27:35,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:35,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 360 conjunts are in the unsatisfiable core [2019-08-05 10:27:35,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:37,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:27:37,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:27:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:27:37,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:37,391 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2019-08-05 10:27:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:39,433 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:27:39,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:27:39,434 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-05 10:27:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:39,435 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:27:39,435 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:27:39,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:27:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:27:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:27:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:27:39,439 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:27:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:39,439 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:27:39,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:27:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:27:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:27:39,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:39,440 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:27:39,440 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 10:27:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:39,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 368 conjunts are in the unsatisfiable core [2019-08-05 10:27:39,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:41,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:41,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:27:41,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:27:41,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:27:41,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:41,412 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2019-08-05 10:27:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:43,530 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:27:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:27:43,531 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-05 10:27:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:43,532 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:27:43,532 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:27:43,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:27:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:27:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:27:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:27:43,535 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:27:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:43,536 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:27:43,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:27:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:27:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:27:43,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:43,536 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:27:43,537 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:43,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:43,537 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 10:27:43,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:43,844 WARN L254 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 376 conjunts are in the unsatisfiable core [2019-08-05 10:27:43,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:45,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:45,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:27:45,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:27:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:27:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:45,417 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2019-08-05 10:27:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:47,655 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:27:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:27:47,656 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-05 10:27:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:47,657 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:27:47,657 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:27:47,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:27:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:27:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:27:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:27:47,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:27:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:47,661 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:27:47,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:27:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:27:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:27:47,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:47,662 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:27:47,662 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 10:27:47,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:47,990 WARN L254 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 384 conjunts are in the unsatisfiable core [2019-08-05 10:27:47,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:49,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:49,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:27:49,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:27:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:27:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:49,790 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2019-08-05 10:27:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:52,175 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:27:52,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:27:52,175 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-05 10:27:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:52,176 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:27:52,176 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:27:52,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:27:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:27:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:27:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:27:52,180 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:27:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:52,180 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:27:52,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:27:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:27:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:27:52,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:52,181 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:27:52,182 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 10:27:52,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:52,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 392 conjunts are in the unsatisfiable core [2019-08-05 10:27:52,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:53,283 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:27:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:54,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:54,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:27:54,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:27:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:27:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:54,663 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2019-08-05 10:27:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:57,141 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:27:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:27:57,142 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-05 10:27:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:57,143 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:27:57,143 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:27:57,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:27:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:27:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:27:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:27:57,148 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:27:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:57,148 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:27:57,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:27:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:27:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:27:57,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:57,149 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:27:57,149 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 10:27:57,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:57,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 400 conjunts are in the unsatisfiable core [2019-08-05 10:27:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:59,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:59,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:27:59,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:27:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:27:59,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:59,002 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2019-08-05 10:28:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:01,560 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:28:01,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:28:01,560 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-05 10:28:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:01,562 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:28:01,562 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:28:01,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:28:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:28:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:28:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:28:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:28:01,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:28:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:01,566 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:28:01,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:28:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:28:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:28:01,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:01,567 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:28:01,567 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:01,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 10:28:01,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:01,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 408 conjunts are in the unsatisfiable core [2019-08-05 10:28:01,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:03,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:03,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:28:03,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:28:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:28:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:28:03,580 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2019-08-05 10:28:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:07,096 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:28:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:28:07,096 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-05 10:28:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:07,098 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:28:07,098 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:28:07,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:28:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:28:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:28:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:28:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:28:07,101 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:28:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:07,102 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:28:07,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:28:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:28:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:28:07,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:07,103 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:28:07,103 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 10:28:07,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:07,558 WARN L254 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 416 conjunts are in the unsatisfiable core [2019-08-05 10:28:07,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:09,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:09,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:28:09,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:28:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:28:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:28:09,337 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2019-08-05 10:28:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:12,125 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:28:12,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:28:12,126 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-05 10:28:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:12,127 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:28:12,127 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:28:12,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:28:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:28:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:28:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:28:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:28:12,130 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:28:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:12,131 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:28:12,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:28:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:28:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:28:12,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:12,132 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:28:12,132 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 10:28:12,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:12,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 424 conjunts are in the unsatisfiable core [2019-08-05 10:28:12,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:14,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:14,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:28:14,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:28:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:28:14,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:28:14,443 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2019-08-05 10:28:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:17,349 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:28:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:28:17,349 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-05 10:28:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:17,350 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:28:17,351 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:28:17,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:28:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:28:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:28:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:28:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:28:17,355 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:28:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:17,355 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:28:17,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:28:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:28:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:28:17,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:17,356 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:28:17,356 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:17,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:17,357 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 10:28:17,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:17,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 432 conjunts are in the unsatisfiable core [2019-08-05 10:28:17,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:19,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:19,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:28:19,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:28:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:28:19,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:28:19,591 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2019-08-05 10:28:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:22,562 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:28:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:28:22,562 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-05 10:28:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:22,563 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:28:22,563 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:28:22,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:28:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:28:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:28:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:28:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:28:22,567 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:28:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:22,567 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:28:22,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:28:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:28:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:28:22,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:22,568 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:28:22,568 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 10:28:22,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:23,035 WARN L254 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 440 conjunts are in the unsatisfiable core [2019-08-05 10:28:23,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:28:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:28:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:28:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:28:24,979 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2019-08-05 10:28:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:27,991 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:28:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:28:27,991 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-08-05 10:28:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:27,992 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:28:27,993 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:28:27,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:28:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:28:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:28:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:28:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:28:27,996 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:28:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:27,997 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:28:27,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:28:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:28:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:28:27,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:27,998 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:28:27,998 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 10:28:27,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:28,555 WARN L254 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 448 conjunts are in the unsatisfiable core [2019-08-05 10:28:28,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:30,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:30,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:28:30,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:28:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:28:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:28:30,466 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2019-08-05 10:28:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:33,678 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:28:33,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:28:33,679 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-08-05 10:28:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:33,680 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:28:33,680 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:28:33,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:28:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:28:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:28:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:28:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:28:33,685 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:28:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:33,685 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:28:33,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:28:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:28:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:28:33,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:33,686 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:28:33,686 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 10:28:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:34,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 456 conjunts are in the unsatisfiable core [2019-08-05 10:28:34,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:36,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:36,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:28:36,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:28:36,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:28:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:28:36,268 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2019-08-05 10:28:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:39,636 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:28:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:28:39,636 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-08-05 10:28:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:39,637 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:28:39,637 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:28:39,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:28:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:28:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:28:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:28:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:28:39,640 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:28:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:39,641 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:28:39,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:28:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:28:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:28:39,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:39,642 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:28:39,642 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2019-08-05 10:28:39,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:40,325 WARN L254 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 464 conjunts are in the unsatisfiable core [2019-08-05 10:28:40,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:42,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:42,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:28:42,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:28:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:28:42,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:28:42,356 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2019-08-05 10:28:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:45,824 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:28:45,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:28:45,824 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-08-05 10:28:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:45,825 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:28:45,825 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:28:45,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:28:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:28:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:28:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:28:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:28:45,829 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 10:28:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:45,829 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:28:45,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:28:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:28:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:28:45,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:45,830 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 10:28:45,830 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2019-08-05 10:28:45,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:46,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 472 conjunts are in the unsatisfiable core [2019-08-05 10:28:46,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:48,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:28:48,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:28:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:28:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:28:48,884 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2019-08-05 10:28:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:52,309 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 10:28:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:28:52,310 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-08-05 10:28:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:52,311 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:28:52,311 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:28:52,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:28:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:28:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 10:28:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:28:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:28:52,315 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 10:28:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:52,315 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:28:52,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:28:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:28:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:28:52,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:52,316 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 10:28:52,316 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2019-08-05 10:28:52,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:52,980 WARN L254 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 480 conjunts are in the unsatisfiable core [2019-08-05 10:28:52,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:28:55,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:55,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:28:55,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:28:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:28:55,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:28:55,031 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2019-08-05 10:28:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:58,665 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:28:58,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:28:58,666 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-08-05 10:28:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:58,667 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:28:58,667 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:28:58,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:28:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:28:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:28:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:28:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:28:58,671 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 10:28:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:58,671 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:28:58,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:28:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:28:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:28:58,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:58,672 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 10:28:58,673 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2019-08-05 10:28:58,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:59,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 488 conjunts are in the unsatisfiable core [2019-08-05 10:28:59,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:59,520 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:28:59,721 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:28:59,913 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:29:00,100 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:29:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:02,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:29:02,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:29:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:29:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:29:02,267 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2019-08-05 10:29:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:06,016 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 10:29:06,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:29:06,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-08-05 10:29:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:06,017 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:29:06,018 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:29:06,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:29:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:29:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:29:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:29:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 10:29:06,021 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 10:29:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:06,022 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 10:29:06,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:29:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 10:29:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:29:06,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:06,023 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 10:29:06,023 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2019-08-05 10:29:06,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:06,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 496 conjunts are in the unsatisfiable core [2019-08-05 10:29:06,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:09,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:29:09,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:29:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:29:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:29:09,098 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2019-08-05 10:29:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:12,946 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 10:29:12,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:29:12,946 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-08-05 10:29:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:12,947 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:29:12,947 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:29:12,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:29:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:29:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 10:29:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:29:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:29:12,950 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-05 10:29:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:12,950 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:29:12,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:29:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:29:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:29:12,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:12,950 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-05 10:29:12,951 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2019-08-05 10:29:12,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:13,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 504 conjunts are in the unsatisfiable core [2019-08-05 10:29:13,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:13,769 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:29:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:16,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:16,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:29:16,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:29:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:29:16,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:29:16,036 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2019-08-05 10:29:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:20,086 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 10:29:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:29:20,087 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-08-05 10:29:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:20,088 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:29:20,088 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:29:20,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:29:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:29:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 10:29:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:29:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-05 10:29:20,091 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-08-05 10:29:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:20,091 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-05 10:29:20,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:29:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-05 10:29:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:29:20,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:20,092 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2019-08-05 10:29:20,093 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2019-08-05 10:29:20,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:20,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 512 conjunts are in the unsatisfiable core [2019-08-05 10:29:20,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:20,971 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:29:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:23,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:23,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:29:23,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:29:23,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:29:23,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:29:23,304 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2019-08-05 10:29:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:27,511 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:29:27,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:29:27,512 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-08-05 10:29:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:27,513 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:29:27,513 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:29:27,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:29:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:29:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:29:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:29:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:29:27,517 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-08-05 10:29:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:27,518 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:29:27,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:29:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:29:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:29:27,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:27,519 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2019-08-05 10:29:27,519 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2019-08-05 10:29:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:28,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 520 conjunts are in the unsatisfiable core [2019-08-05 10:29:28,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:28,334 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:29:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:30,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:30,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:29:30,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:29:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:29:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:29:30,835 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2019-08-05 10:29:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:35,096 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 10:29:35,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:29:35,097 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-08-05 10:29:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:35,098 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:29:35,098 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:29:35,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:29:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:29:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 10:29:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:29:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-08-05 10:29:35,101 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-08-05 10:29:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:35,101 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-08-05 10:29:35,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:29:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-08-05 10:29:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:29:35,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:35,102 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2019-08-05 10:29:35,102 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2019-08-05 10:29:35,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:35,905 WARN L254 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 528 conjunts are in the unsatisfiable core [2019-08-05 10:29:35,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:38,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:38,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:29:38,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:29:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:29:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:29:38,354 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2019-08-05 10:29:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:42,687 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 10:29:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:29:42,688 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-08-05 10:29:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:42,689 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:29:42,689 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:29:42,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:29:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:29:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 10:29:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:29:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:29:42,692 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-08-05 10:29:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:42,693 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:29:42,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:29:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:29:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:29:42,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:42,694 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2019-08-05 10:29:42,694 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2019-08-05 10:29:42,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:43,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 536 conjunts are in the unsatisfiable core [2019-08-05 10:29:43,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:46,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:46,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:29:46,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:29:46,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:29:46,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:29:46,310 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2019-08-05 10:29:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:50,767 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 10:29:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:29:50,767 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-08-05 10:29:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:50,768 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:29:50,768 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:29:50,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:29:50,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:29:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:29:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:29:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-08-05 10:29:50,772 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-08-05 10:29:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:50,772 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-08-05 10:29:50,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:29:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-08-05 10:29:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:29:50,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:50,773 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2019-08-05 10:29:50,774 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2019-08-05 10:29:50,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:51,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 544 conjunts are in the unsatisfiable core [2019-08-05 10:29:51,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:51,690 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:29:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:29:54,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:54,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:29:54,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:29:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:29:54,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:29:54,519 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2019-08-05 10:29:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:59,185 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:29:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:29:59,185 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-08-05 10:29:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:59,186 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:29:59,186 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:29:59,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:29:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:29:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:29:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:29:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:29:59,189 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-08-05 10:29:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:59,190 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:29:59,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:29:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:29:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:29:59,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:59,190 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2019-08-05 10:29:59,191 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2019-08-05 10:29:59,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:00,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 552 conjunts are in the unsatisfiable core [2019-08-05 10:30:00,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:02,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:02,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:30:02,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:30:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:30:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:30:02,799 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2019-08-05 10:30:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:07,591 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 10:30:07,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:30:07,592 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-08-05 10:30:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:07,593 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:30:07,593 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:30:07,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:30:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:30:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 10:30:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:30:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-08-05 10:30:07,596 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-08-05 10:30:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:07,596 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-08-05 10:30:07,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:30:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-08-05 10:30:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:30:07,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:07,597 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2019-08-05 10:30:07,598 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2019-08-05 10:30:07,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:08,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 560 conjunts are in the unsatisfiable core [2019-08-05 10:30:08,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:11,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:11,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:30:11,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:30:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:30:11,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:30:11,575 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2019-08-05 10:30:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:16,566 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 10:30:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:30:16,566 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-08-05 10:30:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:16,567 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:30:16,568 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:30:16,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:30:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:30:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 10:30:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:30:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-05 10:30:16,571 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-08-05 10:30:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:16,571 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-05 10:30:16,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:30:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-05 10:30:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:30:16,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:16,572 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2019-08-05 10:30:16,573 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:16,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:16,573 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2019-08-05 10:30:16,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:17,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 568 conjunts are in the unsatisfiable core [2019-08-05 10:30:17,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:20,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:20,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:30:20,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:30:20,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:30:20,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:30:20,529 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2019-08-05 10:30:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:25,629 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 10:30:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:30:25,630 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-08-05 10:30:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:25,631 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:30:25,631 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:30:25,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:30:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:30:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 10:30:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:30:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-08-05 10:30:25,634 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-08-05 10:30:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:25,634 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-08-05 10:30:25,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:30:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-08-05 10:30:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:30:25,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:25,635 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2019-08-05 10:30:25,635 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2019-08-05 10:30:25,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:26,602 WARN L254 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 576 conjunts are in the unsatisfiable core [2019-08-05 10:30:26,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:30:28,792 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:30:28,793 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:30:28,797 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:30:28,797 INFO L202 PluginConnector]: Adding new model ddlm2013_true-unreach-call.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:28 BoogieIcfgContainer [2019-08-05 10:30:28,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:28,799 INFO L168 Benchmark]: Toolchain (without parser) took 247556.30 ms. Allocated memory was 134.2 MB in the beginning and 1.0 GB in the end (delta: 909.6 MB). Free memory was 111.7 MB in the beginning and 940.0 MB in the end (delta: -828.2 MB). Peak memory consumption was 985.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:28,799 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:28,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.44 ms. Allocated memory is still 134.2 MB. Free memory was 111.5 MB in the beginning and 109.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:28,800 INFO L168 Benchmark]: Boogie Preprocessor took 26.03 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:28,801 INFO L168 Benchmark]: RCFGBuilder took 319.38 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 98.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:28,802 INFO L168 Benchmark]: TraceAbstraction took 247170.55 ms. Allocated memory was 134.2 MB in the beginning and 1.0 GB in the end (delta: 909.6 MB). Free memory was 98.4 MB in the beginning and 940.0 MB in the end (delta: -841.5 MB). Peak memory consumption was 972.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:28,804 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.16 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.44 ms. Allocated memory is still 134.2 MB. Free memory was 111.5 MB in the beginning and 109.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.03 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.38 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 98.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247170.55 ms. Allocated memory was 134.2 MB in the beginning and 1.0 GB in the end (delta: 909.6 MB). Free memory was 98.4 MB in the beginning and 940.0 MB in the end (delta: -841.5 MB). Peak memory consumption was 972.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 59). Cancelled while BasicCegarLoop was analyzing trace of length 147 with TraceHistMax 72,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 247.1s OverallTime, 72 OverallIterations, 72 TraceHistogramMax, 128.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2769 SDtfs, 0 SDslu, 121837 SDs, 0 SdLazy, 126948 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5183 GetRequests, 2627 SyntacticMatches, 0 SemanticMatches, 2556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=71, 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.2s AutomataMinimizationTime, 71 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 8.9s SatisfiabilityAnalysisTime, 106.1s InterpolantComputationTime, 5254 NumberOfCodeBlocks, 5254 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 5183 ConstructedInterpolants, 0 QuantifiedInterpolants, 6413199 SizeOfPredicates, 284 NumberOfNonLiveVariables, 34222 ConjunctsInSsa, 20448 ConjunctsInUnsatCore, 71 InterpolantComputations, 1 PerfectInterpolantSequences, 0/119280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown