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/20170304-DifficultPathPrograms/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:14:08,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:14:08,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:14:08,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:14:08,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:14:08,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:14:08,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:14:08,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:14:08,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:14:08,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:14:08,278 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:14:08,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:14:08,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:14:08,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:14:08,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:14:08,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:14:08,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:14:08,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:14:08,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:14:08,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:14:08,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:14:08,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:14:08,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:14:08,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:14:08,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:14:08,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:14:08,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:14:08,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:14:08,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:14:08,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:14:08,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:14:08,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:14:08,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:14:08,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:14:08,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:14:08,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:14:08,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:14:08,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:14:08,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:14:08,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:14:08,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:14:08,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:14:08,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:14:08,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:14:08,350 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:14:08,351 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:14:08,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2019-08-05 10:14:08,352 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2019-08-05 10:14:08,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:14:08,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:14:08,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:14:08,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:14:08,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:14:08,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:14:08,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:14:08,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:14:08,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:14:08,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/1) ... [2019-08-05 10:14:08,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:14:08,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:14:08,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:14:08,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:14:08,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (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:14:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:14:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:14:08,768 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:14:08,769 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:14:08,770 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:14:08 BoogieIcfgContainer [2019-08-05 10:14:08,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:14:08,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:14:08,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:14:08,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:14:08,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:14:08" (1/2) ... [2019-08-05 10:14:08,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c016d50 and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:14:08, skipping insertion in model container [2019-08-05 10:14:08,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:14:08" (2/2) ... [2019-08-05 10:14:08,779 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond1.i_3.bpl [2019-08-05 10:14:08,789 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:14:08,796 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:14:08,813 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:14:08,840 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:14:08,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:14:08,840 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:14:08,841 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:14:08,841 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:14:08,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:14:08,841 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:14:08,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:14:08,842 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:14:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:14:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:14:08,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:08,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:14:08,865 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:14:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:08,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:14:08,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,023 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:14:09,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:09,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:14:09,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:09,048 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:14:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:09,088 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:14:09,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:09,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:14:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:09,101 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:14:09,101 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:14:09,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:14:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:14:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:14:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:14:09,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:14:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:09,136 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:14:09,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:14:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:14:09,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:09,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:14:09,138 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:14:09,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:09,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:14:09,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:09,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:09,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:14:09,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:14:09,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:14:09,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:14:09,303 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:14:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:09,368 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:14:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:14:09,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:14:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:09,369 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:14:09,369 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:14:09,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:14:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:14:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:14:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:14:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:14:09,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:14:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:09,375 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:14:09,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:14:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:14:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:14:09,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:09,376 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:14:09,376 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:14:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:09,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:14:09,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:09,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:09,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:14:09,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:14:09,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:14:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:14:09,494 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:14:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:09,540 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:14:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:14:09,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:14:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:09,543 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:14:09,543 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:14:09,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:14:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:14:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:14:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:14:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:14:09,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:14:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:09,547 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:14:09,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:14:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:14:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:14:09,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:09,548 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:14:09,548 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:14:09,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:09,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:14:09,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,658 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:14:09,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:09,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:14:09,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:14:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:14:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:14:09,660 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:14:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:09,738 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:14:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:14:09,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:14:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:09,739 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:14:09,740 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:14:09,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:14:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:14:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:14:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:14:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:14:09,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:14:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:09,743 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:14:09,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:14:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:14:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:14:09,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:09,744 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:14:09,744 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:14:09,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:09,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:14:09,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:09,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:14:09,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:14:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:14:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:14:09,935 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:14:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,128 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:14:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:14:10,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:14:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,133 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:14:10,134 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:14:10,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:14:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:14:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:14:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:14:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:14:10,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:14:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,137 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:14:10,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:14:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:14:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:14:10,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,138 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:14:10,138 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:14:10,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:10,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:10,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:14:10,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:10,296 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:14:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,487 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:14:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:14:10,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:14:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,490 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:14:10,490 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:14:10,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:14:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:14:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:14:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:14:10,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:14:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,493 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:14:10,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:14:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:14:10,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,495 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:14:10,495 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:14:10,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:10,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:10,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:10,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:14:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:14:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:14:10,653 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:14:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,737 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:14:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:14:10,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:14:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,738 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:14:10,739 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:14:10,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:14:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:14:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:14:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:14:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:14:10,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:14:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,743 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:14:10,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:14:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:14:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:14:10,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,744 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:14:10,744 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:14:10,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:11,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:11,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:14:11,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:11,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:11,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:11,352 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:14:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:11,460 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:14:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:14:11,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:14:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:11,462 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:14:11,462 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:14:11,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:14:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:14:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:14:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:14:11,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:14:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:11,466 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:14:11,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:14:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:14:11,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:11,467 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:14:11,467 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:14:11,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:11,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:14:11,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:11,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:11,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:14:11,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:14:11,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:14:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:11,671 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:14:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:11,797 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:14:11,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:14:11,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:14:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:11,799 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:14:11,799 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:14:11,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:14:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:14:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:14:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:14:11,802 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:14:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:11,803 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:14:11,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:14:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:14:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:11,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:11,806 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:14:11,806 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:14:11,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:11,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:14:11,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:12,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:12,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:14:12,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:14:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:14:12,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:14:12,217 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:14:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:12,441 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:14:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:12,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:14:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:12,442 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:14:12,443 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:14:12,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:14:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:14:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:14:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:14:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:14:12,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:14:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:12,447 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:14:12,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:14:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:14:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:14:12,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:12,448 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:14:12,448 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:14:12,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:12,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:14:12,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:12,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:12,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:14:12,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:14:12,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:14:12,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:14:12,688 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:14:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:12,920 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:14:12,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:14:12,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:14:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:12,925 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:14:12,925 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:14:12,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:14:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:14:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:14:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:14:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:14:12,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:14:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:12,930 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:14:12,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:14:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:14:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:14:12,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:12,931 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:14:12,931 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:14:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:12,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:14:12,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:13,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:13,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:14:13,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:14:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:14:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:14:13,082 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:14:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:13,237 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:14:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:14:13,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:14:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:13,239 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:14:13,239 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:14:13,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:14:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:14:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:14:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:14:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:14:13,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:14:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:13,243 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:14:13,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:14:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:14:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:14:13,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:13,244 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:14:13,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:14:13,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:13,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:14:13,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:13,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:13,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:14:13,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:14:13,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:14:13,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:14:13,487 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:14:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:13,684 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:14:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:14:13,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:14:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:13,692 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:14:13,692 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:14:13,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:14:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:14:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:14:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:14:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:14:13,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:14:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:13,696 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:14:13,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:14:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:14:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:13,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:13,697 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:14:13,698 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:13,698 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:14:13,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:13,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:14:13,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:13,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:13,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:14:13,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:14:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:14:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:14:13,924 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:14:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:14,193 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:14:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:14:14,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:14:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:14,195 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:14:14,195 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:14:14,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:14:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:14:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:14:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:14:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:14:14,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:14:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:14,199 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:14:14,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:14:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:14:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:14:14,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:14,200 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:14:14,201 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:14:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:14,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:14:14,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:14,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:14,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:14:14,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:14:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:14:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:14,368 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:14:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:14,596 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:14:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:14:14,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:14:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:14,598 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:14:14,598 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:14:14,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:14:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:14:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:14:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:14:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:14:14,602 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:14:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:14,602 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:14:14,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:14:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:14:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:14:14,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:14,603 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:14:14,603 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:14:14,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:14,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:14:14,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:15,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:15,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:14:15,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:14:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:14:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:14:15,373 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:14:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:15,834 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:14:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:14:15,834 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:14:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:15,835 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:14:15,836 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:14:15,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:14:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:14:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:14:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:14:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:14:15,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:14:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:15,840 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:14:15,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:14:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:14:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:14:15,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:15,842 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:14:15,842 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:14:15,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:15,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:14:15,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:14:16,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:14:16,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:14:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:14:16,480 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:14:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:16,772 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:14:16,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:14:16,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:14:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:16,774 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:14:16,775 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:14:16,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:14:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:14:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:14:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:14:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:14:16,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:14:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:16,778 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:14:16,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:14:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:14:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:14:16,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:16,779 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:14:16,779 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:14:16,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:16,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:14:16,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:17,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:17,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:14:17,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:14:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:14:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:17,332 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:14:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:17,770 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:14:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:14:17,771 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:14:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:17,772 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:14:17,772 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:14:17,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:14:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:14:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:14:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:14:17,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:14:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:17,776 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:14:17,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:14:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:14:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:14:17,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:17,777 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:14:17,778 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:14:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:17,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:14:17,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:18,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:18,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:14:18,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:14:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:14:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:18,066 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:14:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:18,451 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:14:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:18,451 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:14:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:18,452 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:14:18,452 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:14:18,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:14:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:14:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:14:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:14:18,457 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:14:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:18,457 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:14:18,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:14:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:14:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:14:18,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:18,458 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:14:18,459 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:14:18,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:18,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:14:18,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:18,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:18,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:14:18,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:14:18,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:14:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:18,703 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:14:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,112 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:14:19,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:14:19,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:14:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,113 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:14:19,113 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:14:19,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:14:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:14:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:14:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:14:19,117 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:14:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,118 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:14:19,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:14:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:14:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:14:19,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,119 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:14:19,119 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:14:19,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:19,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:14:19,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:19,441 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:14:19,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:19,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:14:19,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:14:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:14:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:19,442 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:14:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,864 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:14:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:14:19,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:14:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,865 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:14:19,865 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:14:19,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:14:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:14:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:14:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:14:19,870 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:14:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,870 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:14:19,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:14:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:14:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:14:19,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,871 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:14:19,872 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:14:19,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:19,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:14:19,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:21,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:14:21,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:14:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:14:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:21,280 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:14:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:21,780 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:14:21,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:14:21,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:14:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:21,783 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:14:21,783 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:14:21,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:14:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:14:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:14:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:14:21,787 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:14:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:21,787 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:14:21,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:14:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:14:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:14:21,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:21,788 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:14:21,788 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:14:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:21,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:14:21,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:22,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:22,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:14:22,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:14:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:14:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:14:22,543 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:14:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:23,416 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:14:23,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:14:23,418 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:14:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:23,419 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:14:23,419 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:14:23,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:14:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:14:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:14:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:14:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:14:23,422 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:14:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:23,422 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:14:23,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:14:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:14:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:14:23,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:23,423 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:14:23,423 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:14:23,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:23,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:14:23,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:23,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:23,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:14:23,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:14:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:14:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:23,750 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:14:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:24,468 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:14:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:14:24,468 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:14:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:24,469 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:14:24,469 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:14:24,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:14:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:14:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:14:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:14:24,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:14:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:24,474 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:14:24,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:14:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:14:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:14:24,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:24,475 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:14:24,476 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:14:24,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:24,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:14:24,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:24,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:24,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:14:24,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:14:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:14:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:14:24,835 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:14:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:25,389 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:14:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:14:25,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:14:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:25,391 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:14:25,391 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:14:25,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:14:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:14:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:14:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:14:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:14:25,394 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:14:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:25,395 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:14:25,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:14:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:14:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:14:25,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:25,396 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:14:25,396 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:14:25,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:25,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:14:25,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:25,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:25,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:14:25,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:14:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:14:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:14:25,735 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:14:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:26,318 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:14:26,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:14:26,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:14:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:26,319 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:14:26,319 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:14:26,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:14:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:14:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:14:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:14:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:14:26,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:14:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:26,323 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:14:26,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:14:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:14:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:14:26,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:26,324 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:14:26,324 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:14:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:26,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:14:26,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:26,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:26,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:14:26,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:14:26,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:14:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:26,835 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:14:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:27,583 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:14:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:14:27,584 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:14:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:27,584 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:14:27,585 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:14:27,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:14:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:14:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:14:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:14:27,588 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:14:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:27,589 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:14:27,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:14:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:14:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:14:27,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:27,590 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:14:27,590 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:14:27,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:27,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:14:27,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:27,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:27,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:14:27,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:14:27,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:14:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:14:27,991 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:14:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:28,681 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:14:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:14:28,681 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:14:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:28,682 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:14:28,682 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:14:28,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:14:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:14:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:14:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:14:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:14:28,686 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:14:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:28,687 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:14:28,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:14:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:14:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:14:28,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:28,687 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:14:28,688 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:14:28,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:28,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:14:28,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:29,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:29,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:14:29,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:14:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:14:29,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:14:29,118 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:14:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:29,842 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:14:29,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:14:29,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:14:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:29,843 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:14:29,843 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:14:29,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:14:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:14:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:14:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:14:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:14:29,848 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:14:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:29,848 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:14:29,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:14:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:14:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:14:29,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:29,849 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:14:29,849 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:14:29,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:29,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:14:29,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:30,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:14:30,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:14:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:14:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:14:30,304 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:14:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:31,077 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:14:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:14:31,077 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:14:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:31,078 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:14:31,078 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:14:31,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:14:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:14:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:14:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:14:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:14:31,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:14:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:31,083 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:14:31,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:14:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:14:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:14:31,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:31,083 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:14:31,084 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:14:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:31,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:14:31,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:31,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:31,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:14:31,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:14:31,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:14:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:14:31,561 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:14:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:32,431 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:14:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:14:32,431 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:14:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:32,432 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:14:32,432 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:14:32,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:14:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:14:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:14:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:14:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:14:32,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:14:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:32,436 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:14:32,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:14:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:14:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:14:32,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:32,437 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:14:32,437 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:14:32,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:32,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:14:32,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:33,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:33,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:14:33,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:14:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:14:33,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:14:33,461 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:14:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:34,327 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:14:34,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:14:34,327 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:14:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:34,328 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:14:34,328 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:14:34,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:14:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:14:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:14:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:14:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:14:34,331 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:14:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:34,331 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:14:34,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:14:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:14:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:14:34,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:34,332 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:14:34,332 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:34,333 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:14:34,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:34,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:14:34,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:34,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:34,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:14:34,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:14:34,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:14:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:14:34,831 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:14:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:35,805 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:14:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:14:35,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:14:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:35,806 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:14:35,806 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:14:35,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:14:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:14:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:14:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:14:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:14:35,810 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:14:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:35,810 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:14:35,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:14:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:14:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:14:35,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:35,811 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:14:35,811 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:14:35,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:35,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:14:35,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:37,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:37,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:14:37,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:14:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:14:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:14:37,112 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:14:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:38,215 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:14:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:14:38,215 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:14:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:38,216 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:14:38,216 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:14:38,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:14:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:14:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:14:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:14:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:14:38,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:14:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:38,220 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:14:38,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:14:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:14:38,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:14:38,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:38,221 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:14:38,221 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:14:38,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:38,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:14:38,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:38,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:38,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:14:38,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:14:38,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:14:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:14:38,998 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:14:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:40,064 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:14:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:14:40,064 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:14:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:40,065 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:14:40,065 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:14:40,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:14:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:14:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:14:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:14:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:14:40,069 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:14:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:40,069 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:14:40,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:14:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:14:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:14:40,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:40,070 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:14:40,070 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:14:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:40,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:40,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:40,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:40,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:40,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:14:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:14:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:14:40,986 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:14:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:42,082 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:14:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:14:42,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:14:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:42,083 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:14:42,084 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:14:42,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:14:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:14:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:14:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:14:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:14:42,087 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:14:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:42,087 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:14:42,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:14:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:14:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:14:42,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:42,088 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:14:42,088 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:14:42,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:42,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:42,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:43,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:43,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:14:43,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:43,052 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:14:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:44,222 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:14:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:14:44,222 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:14:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:44,223 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:14:44,223 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:14:44,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 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:14:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:14:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:14:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:14:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:14:44,227 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:14:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:44,227 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:14:44,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:14:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:14:44,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:44,228 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:14:44,228 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:14:44,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:44,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:14:44,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:44,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:44,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:44,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:14:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:14:44,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:14:44,841 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:14:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,069 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:14:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:14:46,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:14:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,070 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:14:46,070 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:14:46,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:14:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:14:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:14:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:14:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:14:46,073 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:14:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:46,073 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:14:46,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:14:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:14:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:14:46,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,074 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:14:46,074 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:14:46,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:46,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:46,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:46,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:46,843 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:14:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:48,201 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:14:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:14:48,202 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:14:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:48,202 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:14:48,203 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:14:48,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:14:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:14:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:14:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:14:48,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:14:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:48,206 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:14:48,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:14:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:14:48,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:48,207 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:14:48,207 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:14:48,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:48,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:14:48,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:49,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:14:49,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:49,194 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:14:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:50,545 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:14:50,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:14:50,546 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:14:50,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:50,547 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:14:50,547 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:14:50,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:14:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:14:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:14:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:14:50,550 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:14:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:50,550 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:14:50,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:14:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:14:50,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:50,551 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:14:50,551 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:14:50,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:50,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:14:50,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:51,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:51,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:14:51,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:14:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:14:51,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:14:51,309 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:14:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:52,754 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:14:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:14:52,754 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:14:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:52,755 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:14:52,755 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:14:52,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:14:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:14:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:14:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:14:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:14:52,759 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:14:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:52,759 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:14:52,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:14:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:14:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:14:52,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:52,760 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:14:52,760 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:14:52,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:52,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:14:52,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:14:53,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:14:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:14:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:14:53,772 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:14:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:55,252 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:14:55,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:14:55,252 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:14:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:55,253 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:14:55,253 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:14:55,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:14:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:14:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:14:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:14:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:14:55,256 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:14:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:55,256 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:14:55,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:14:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:14:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:14:55,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:55,257 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:14:55,257 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:14:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:55,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:14:55,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:56,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:56,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:56,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:14:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:14:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:14:56,073 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:14:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:57,641 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:14:57,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:14:57,642 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:14:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:57,643 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:14:57,643 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:14:57,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:14:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:14:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:14:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:14:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:14:57,646 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:14:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:57,647 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:14:57,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:14:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:14:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:14:57,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:57,647 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:14:57,648 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:14:57,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:57,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:14:57,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:58,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:58,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:14:58,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:58,868 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:15:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:00,522 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:15:00,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:15:00,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:15:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:00,523 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:15:00,524 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:15:00,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:15:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:15:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:15:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:15:00,526 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:15:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:00,527 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:15:00,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:15:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:15:00,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:00,528 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:15:00,528 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:15:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:00,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:15:00,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:01,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:01,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:01,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:15:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:15:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:15:01,677 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:15:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:03,501 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:15:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:15:03,501 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:15:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:03,502 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:15:03,502 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:15:03,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:15:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:15:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:15:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:15:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:15:03,505 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:15:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:03,505 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:15:03,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:15:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:15:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:15:03,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:03,506 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:15:03,506 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:03,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:15:03,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:03,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:15:03,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:04,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:04,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:04,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:04,565 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:15:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:06,344 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:15:06,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:15:06,345 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:15:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:06,346 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:15:06,346 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:15:06,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:15:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:15:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:15:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:15:06,349 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:15:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:06,349 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:15:06,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:15:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:15:06,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:06,350 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:15:06,350 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:15:06,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:06,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:15:06,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:07,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:07,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:15:07,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:07,237 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:15:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:09,220 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:15:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:15:09,221 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:15:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:09,222 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:15:09,222 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:15:09,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:15:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:15:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:15:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:15:09,225 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:15:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:09,225 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:15:09,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:15:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:15:09,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:09,226 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:15:09,226 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:15:09,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:09,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:15:09,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:10,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:10,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:15:10,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:15:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:15:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:15:10,254 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:15:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:12,170 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:15:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:15:12,171 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:15:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:12,172 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:15:12,172 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:15:12,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:15:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:15:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:15:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:15:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:15:12,175 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:15:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:12,175 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:15:12,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:15:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:15:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:15:12,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:12,176 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:15:12,176 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:15:12,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:12,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:15:12,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:13,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:13,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:15:13,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:15:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:15:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:15:13,184 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:15:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,332 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:15:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:15:15,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:15:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,333 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:15:15,334 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:15:15,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:15:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:15:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:15:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:15:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:15:15,337 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:15:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,337 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:15:15,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:15:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:15:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:15:15,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,338 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:15:15,339 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:15:15,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:16,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:16,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:15:16,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:15:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:15:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:15:16,364 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:15:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:18,501 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:15:18,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:15:18,502 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:15:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:18,503 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:15:18,503 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:15:18,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:15:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:15:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:15:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:15:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:15:18,506 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:15:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:18,506 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:15:18,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:15:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:15:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:15:18,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:18,507 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:15:18,507 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:15:18,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:18,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:15:18,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:19,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:19,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:15:19,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:15:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:15:19,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:15:19,715 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:15:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:21,897 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:15:21,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:15:21,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:15:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:21,899 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:15:21,899 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:15:21,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:15:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:15:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:15:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:15:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:15:21,902 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:15:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:21,902 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:15:21,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:15:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:15:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:15:21,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:21,903 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:15:21,903 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:15:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:21,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:15:21,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:22,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:15:22,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:15:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:15:22,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:15:22,998 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:15:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,394 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:15:25,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:15:25,394 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:15:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,395 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:15:25,395 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:15:25,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:15:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:15:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:15:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:15:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:15:25,396 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:15:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,397 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:15:25,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:15:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:15:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:15:25,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,398 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:15:25,398 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:15:25,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:26,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:15:26,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:15:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:15:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:15:26,888 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:15:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:29,396 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:15:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:15:29,397 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:15:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:29,398 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:15:29,398 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:15:29,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:15:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:15:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:15:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:15:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:15:29,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:15:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:29,402 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:15:29,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:15:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:15:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:15:29,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,403 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:15:29,403 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:15:29,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:29,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:15:29,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:30,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:30,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:15:30,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:15:30,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:15:30,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:15:30,645 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:15:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:33,262 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:15:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:15:33,262 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:15:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:33,263 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:15:33,264 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:15:33,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:15:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:15:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:15:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:15:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:15:33,266 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:15:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:33,267 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:15:33,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:15:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:15:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:15:33,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:33,267 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:15:33,267 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:15:33,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:33,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:15:33,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:34,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:15:34,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:15:34,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:15:34,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:15:34,778 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:15:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,499 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:15:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:15:37,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:15:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,500 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:15:37,500 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:15:37,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:15:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:15:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:15:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:15:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:15:37,502 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:15:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,502 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:15:37,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:15:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:15:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:15:37,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,503 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:15:37,503 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:15:37,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:15:38,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:15:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:15:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:15:38,779 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:15:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:41,675 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:15:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:15:41,675 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:15:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:41,676 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:15:41,676 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:15:41,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:15:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:15:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:15:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:15:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:15:41,680 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:15:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:41,680 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:15:41,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:15:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:15:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:15:41,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:41,681 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:15:41,681 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:15:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:41,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:15:41,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:43,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:43,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:15:43,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:15:43,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:15:43,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:15:43,019 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:15:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:45,990 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:15:45,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:15:45,991 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:15:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:45,992 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:15:45,992 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:15:45,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:15:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:15:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:15:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:15:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:15:45,996 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:15:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:45,996 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:15:45,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:15:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:15:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:15:45,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:45,997 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:15:45,997 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:15:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:46,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:15:46,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:47,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:47,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:15:47,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:15:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:15:47,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:15:47,525 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:15:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,582 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:15:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:15:50,583 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:15:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,584 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:15:50,584 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:15:50,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:15:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:15:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:15:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:15:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:15:50,587 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:15:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:50,587 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:15:50,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:15:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:15:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:15:50,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:50,588 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:15:50,589 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:50,589 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:15:50,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:50,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:15:50,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:15:52,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:15:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:15:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:15:52,106 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:15:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:55,305 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:15:55,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:15:55,306 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:15:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:55,306 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:15:55,307 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:15:55,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:15:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:15:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:15:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:15:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:15:55,309 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:15:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:55,309 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:15:55,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:15:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:15:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:15:55,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:55,310 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:15:55,310 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:15:55,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:55,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:15:55,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:56,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:56,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:15:56,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:15:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:15:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:15:56,847 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:16:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:00,168 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:16:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:16:00,169 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:16:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:00,169 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:16:00,169 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:16:00,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:16:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:16:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:16:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:16:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:16:00,171 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:16:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:00,172 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:16:00,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:16:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:16:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:16:00,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:00,172 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:16:00,172 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:16:00,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:00,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:16:00,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:01,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:16:01,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:16:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:16:01,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:16:01,658 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:16:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:05,044 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:16:05,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:16:05,045 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:16:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:05,046 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:16:05,046 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:16:05,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:16:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:16:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:16:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:16:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:16:05,049 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:16:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:05,049 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:16:05,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:16:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:16:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:16:05,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:05,051 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:16:05,051 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:05,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:16:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:05,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:16:05,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:07,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:07,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:16:07,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:16:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:16:07,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:16:07,545 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:16:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:11,000 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:16:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:16:11,000 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:16:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:11,001 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:16:11,001 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:16:11,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:16:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:16:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:16:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:16:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:16:11,004 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:16:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:11,004 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:16:11,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:16:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:16:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:16:11,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:11,005 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:16:11,005 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:16:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:11,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:16:11,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:12,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:16:12,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:16:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:16:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:16:12,628 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:16:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:16,233 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:16:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:16:16,234 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:16:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:16,235 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:16:16,235 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:16:16,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:16:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:16:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:16:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:16:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:16:16,238 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:16:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:16,239 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:16:16,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:16:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:16:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:16:16,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:16,239 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:16:16,240 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:16:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:16,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:16:16,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:17,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:17,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:16:17,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:16:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:16:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:16:17,875 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:16:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:21,579 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:16:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:16:21,580 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:16:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:21,581 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:16:21,581 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:16:21,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:16:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:16:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:16:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:16:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:16:21,584 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:16:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:21,585 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:16:21,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:16:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:16:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:16:21,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:21,586 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:16:21,586 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:21,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:21,586 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:16:21,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:21,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:16:21,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:16:23,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:16:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:16:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:16:23,275 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:16:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:27,074 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:16:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:16:27,074 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:16:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:27,075 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:16:27,075 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:16:27,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:16:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:16:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:16:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:16:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:16:27,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:16:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:27,078 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:16:27,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:16:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:16:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:16:27,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:27,079 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:16:27,079 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:16:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:27,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:16:27,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:28,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:28,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:16:28,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:16:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:16:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:16:28,838 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:16:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:32,792 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:16:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:16:32,793 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:16:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:32,794 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:16:32,794 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:16:32,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:16:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:16:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:16:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:16:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:16:32,796 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:16:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:32,797 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:16:32,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:16:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:16:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:16:32,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:32,797 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:16:32,798 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:32,798 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:16:32,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:32,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:16:32,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:34,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:34,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:16:34,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:16:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:16:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:16:34,571 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:16:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,567 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:16:38,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:16:38,568 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:16:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,568 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:16:38,569 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:16:38,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:16:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:16:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:16:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:16:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:16:38,571 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:16:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,572 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:16:38,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:16:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:16:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:16:38,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,573 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:16:38,573 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:16:38,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:41,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:41,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:16:41,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:16:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:16:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:16:41,827 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:16:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,028 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:16:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:16:46,029 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:16:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,030 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:16:46,030 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:16:46,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:16:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:16:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:16:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:16:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:16:46,032 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:16:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,033 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:16:46,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:16:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:16:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:16:46,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,033 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:16:46,034 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:16:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:16:47,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:16:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:16:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:16:47,873 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:16:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:52,103 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:16:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:16:52,104 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:16:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:52,105 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:16:52,105 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:16:52,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:16:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:16:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:16:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:16:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:16:52,107 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:16:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:52,107 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:16:52,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:16:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:16:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:16:52,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:52,108 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:16:52,108 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:16:52,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:52,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:16:52,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:54,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:54,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:16:54,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:16:54,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:16:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:16:54,040 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:16:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:58,390 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:16:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:16:58,391 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:16:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:58,392 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:16:58,392 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:16:58,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:16:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:16:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:16:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:16:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:16:58,395 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:16:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:58,395 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:16:58,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:16:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:16:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:16:58,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:58,396 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:16:58,396 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:16:58,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:58,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:16:58,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:00,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:00,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:17:00,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:17:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:17:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:17:00,544 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:17:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,985 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:17:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:17:04,986 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:17:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,987 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:17:04,987 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:17:04,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:17:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:17:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:17:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:17:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:17:04,990 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:17:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,991 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:17:04,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:17:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:17:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:17:04,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,991 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:17:04,992 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:17:04,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:17:07,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:17:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:17:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:17:07,613 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:17:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:12,111 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:17:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:17:12,112 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:17:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:12,113 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:17:12,113 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:17:12,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:17:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:17:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:17:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:17:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:17:12,116 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:17:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:12,117 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:17:12,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:17:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:17:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:17:12,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:12,117 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:17:12,118 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:17:12,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:12,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:17:12,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:14,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:17:14,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:17:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:17:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:17:14,288 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:17:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:18,871 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:17:18,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:17:18,872 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:17:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:18,873 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:17:18,873 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:17:18,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:17:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:17:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:17:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:17:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:17:18,876 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:17:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:18,876 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:17:18,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:17:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:17:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:17:18,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:18,877 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:17:18,877 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:17:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:18,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:17:18,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:21,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:21,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:17:21,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:17:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:17:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:17:21,038 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:17:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:25,724 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:17:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:17:25,724 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:17:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:25,725 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:17:25,725 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:17:25,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:17:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:17:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:17:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:17:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:17:25,728 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:17:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:25,728 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:17:25,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:17:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:17:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:17:25,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:25,729 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:17:25,730 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:17:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:25,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:17:25,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:28,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:17:28,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:17:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:17:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:17:28,179 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:17:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:33,048 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:17:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:17:33,049 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:17:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:33,049 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:17:33,050 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:17:33,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:17:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:17:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:17:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:17:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:17:33,052 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:17:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:33,053 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:17:33,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:17:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:17:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:17:33,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:33,054 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:17:33,054 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:17:33,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:33,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:17:33,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:17:35,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:17:35,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:17:35,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:17:35,344 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:17:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:40,269 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:17:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:17:40,269 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:17:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:40,270 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:17:40,270 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:17:40,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:17:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:17:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:17:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:17:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:17:40,273 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:17:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:40,273 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:17:40,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:17:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:17:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:17:40,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:40,274 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:17:40,274 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:17:40,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:40,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:17:40,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:42,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:42,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:17:42,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:17:42,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:17:42,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:17:42,863 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:17:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:47,965 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:17:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:17:47,965 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:17:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:47,966 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:17:47,966 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:17:47,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:17:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:17:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:17:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:17:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:17:47,969 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:17:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:47,970 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:17:47,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:17:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:17:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:17:47,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:47,971 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:17:47,971 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:17:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:48,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:17:48,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:50,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:50,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:17:50,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:17:50,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:17:50,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:17:50,359 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:17:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:55,814 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:17:55,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:17:55,815 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:17:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:55,815 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:17:55,815 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:17:55,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:17:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:17:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:17:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:17:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:17:55,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:17:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:55,819 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:17:55,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:17:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:17:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:17:55,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:55,820 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:17:55,820 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:17:55,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:55,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:17:55,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:58,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:17:58,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:17:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:17:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:17:58,516 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:18:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,860 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:18:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:18:03,861 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:18:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,862 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:18:03,862 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:18:03,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:18:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:18:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:18:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:18:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:18:03,865 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:18:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,865 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:18:03,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:18:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:18:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:18:03,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,866 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:18:03,866 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:18:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:06,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:06,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:18:06,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:18:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:18:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:18:06,362 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:18:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:11,855 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:18:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:18:11,856 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:18:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:11,857 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:18:11,857 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:18:11,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:18:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:18:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:18:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:18:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:18:11,859 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:18:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:11,860 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:18:11,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:18:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:18:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:18:11,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:11,861 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:18:11,861 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:11,861 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:18:11,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:11,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:18:11,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:15,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:15,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:18:15,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:18:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:18:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:18:15,064 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. Received shutdown request... [2019-08-05 10:18:20,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:18:20,526 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:18:20,532 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:18:20,532 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:18:20 BoogieIcfgContainer [2019-08-05 10:18:20,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:18:20,534 INFO L168 Benchmark]: Toolchain (without parser) took 252142.12 ms. Allocated memory was 139.5 MB in the beginning and 230.7 MB in the end (delta: 91.2 MB). Free memory was 109.1 MB in the beginning and 65.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 135.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:20,534 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:18:20,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.48 ms. Allocated memory is still 139.5 MB. Free memory was 108.9 MB in the beginning and 107.3 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:18:20,536 INFO L168 Benchmark]: Boogie Preprocessor took 23.26 ms. Allocated memory is still 139.5 MB. Free memory was 107.3 MB in the beginning and 106.2 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:18:20,536 INFO L168 Benchmark]: RCFGBuilder took 317.50 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 96.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:20,537 INFO L168 Benchmark]: TraceAbstraction took 251760.22 ms. Allocated memory was 139.5 MB in the beginning and 230.7 MB in the end (delta: 91.2 MB). Free memory was 96.3 MB in the beginning and 65.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:18:20,540 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.48 ms. Allocated memory is still 139.5 MB. Free memory was 108.9 MB in the beginning and 107.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.26 ms. Allocated memory is still 139.5 MB. Free memory was 107.3 MB in the beginning and 106.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.50 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 96.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251760.22 ms. Allocated memory was 139.5 MB in the beginning and 230.7 MB in the end (delta: 91.2 MB). Free memory was 96.3 MB in the beginning and 65.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (84states) and FLOYD_HOARE automaton (currently 83 states, 83 states before enhancement),while ReachableStatesComputation was computing reachable states (81 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 251.7s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 161.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 0 SDslu, 3240 SDs, 0 SdLazy, 186920 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 133.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3402 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=80, 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, 80 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 87.6s InterpolantComputationTime, 3483 NumberOfCodeBlocks, 3483 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 3402 ConstructedInterpolants, 0 QuantifiedInterpolants, 554688 SizeOfPredicates, 243 NumberOfNonLiveVariables, 17334 ConjunctsInSsa, 6804 ConjunctsInUnsatCore, 81 InterpolantComputations, 1 PerfectInterpolantSequences, 0/88560 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown