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/abstractInterpretation/unclassified/CallNTimes.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:02,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:02,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:02,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:02,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:02,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:02,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:02,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:02,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:02,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:02,960 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:02,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:02,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:02,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:02,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:02,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:02,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:02,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:02,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:02,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:02,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:02,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:02,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:02,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:02,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:02,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:02,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:02,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:02,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:02,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:02,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:02,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:02,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:02,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:02,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:02,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:02,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:02,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:02,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:02,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:02,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:03,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:03,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:03,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:03,034 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:03,035 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:03,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CallNTimes.bpl [2019-08-05 11:16:03,036 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CallNTimes.bpl' [2019-08-05 11:16:03,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:03,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:03,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:03,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:03,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:03,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,111 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:03,111 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:03,111 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:03,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:03,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:03,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:03,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:03,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/1) ... [2019-08-05 11:16:03,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:03,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:03,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:03,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:03,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (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 11:16:03,215 INFO L124 BoogieDeclarations]: Specification and implementation of procedure nRec given in one single declaration [2019-08-05 11:16:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure nRec [2019-08-05 11:16:03,215 INFO L138 BoogieDeclarations]: Found implementation of procedure nRec [2019-08-05 11:16:03,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:03,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:03,455 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:03,455 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:16:03,457 INFO L202 PluginConnector]: Adding new model CallNTimes.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:03 BoogieIcfgContainer [2019-08-05 11:16:03,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:03,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:03,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:03,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:03,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:03" (1/2) ... [2019-08-05 11:16:03,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178db647 and model type CallNTimes.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:03, skipping insertion in model container [2019-08-05 11:16:03,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CallNTimes.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:03" (2/2) ... [2019-08-05 11:16:03,466 INFO L109 eAbstractionObserver]: Analyzing ICFG CallNTimes.bpl [2019-08-05 11:16:03,475 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:03,482 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:16:03,499 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:16:03,525 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:03,526 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:03,527 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:03,527 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:03,527 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:03,527 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:03,528 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:03,528 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:03,528 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-08-05 11:16:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:16:03,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:03,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:16:03,556 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 37992, now seen corresponding path program 1 times [2019-08-05 11:16:03,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:03,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:16:03,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:03,683 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 11:16:03,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:03,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:03,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:16:03,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:16:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:16:03,710 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-08-05 11:16:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:03,846 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:16:03,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:16:03,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:16:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:03,855 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:16:03,856 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:03,858 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 11:16:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-08-05 11:16:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:16:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:16:03,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 3 [2019-08-05 11:16:03,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:03,898 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:16:03,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:16:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:16:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:16:03,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:03,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:16:03,901 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1852341070, now seen corresponding path program 1 times [2019-08-05 11:16:03,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:03,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:16:03,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:04,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:04,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:16:04,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:04,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:04,012 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-08-05 11:16:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,095 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:16:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:04,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:16:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,098 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:16:04,099 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:04,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:16:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:16:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:16:04,104 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2019-08-05 11:16:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,105 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:16:04,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:16:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:16:04,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,106 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:16:04,107 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1602390544, now seen corresponding path program 1 times [2019-08-05 11:16:04,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:16:04,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:04,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:04,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:04,181 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2019-08-05 11:16:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,242 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 11:16:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:04,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-08-05 11:16:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,245 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:16:04,246 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:16:04,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:16:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:16:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:16:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-08-05 11:16:04,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-08-05 11:16:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,253 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-08-05 11:16:04,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-08-05 11:16:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:16:04,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,254 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-08-05 11:16:04,255 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash -258732680, now seen corresponding path program 2 times [2019-08-05 11:16:04,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 11:16:04,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:04,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:16:04,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:04,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:04,412 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-08-05 11:16:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,510 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 11:16:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:04,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-08-05 11:16:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,511 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:16:04,512 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:16:04,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:16:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:16:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:16:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 11:16:04,517 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 23 [2019-08-05 11:16:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,517 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 11:16:04,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 11:16:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:16:04,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,519 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:16:04,519 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash 569221562, now seen corresponding path program 1 times [2019-08-05 11:16:04,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:16:04,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:04,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:16:04,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:04,653 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 5 states. [2019-08-05 11:16:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:04,842 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2019-08-05 11:16:04,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:04,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-08-05 11:16:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:04,847 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:16:04,847 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:16:04,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:16:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:16:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:16:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 11:16:04,853 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-08-05 11:16:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:04,854 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 11:16:04,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 11:16:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:16:04,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:04,855 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:04,856 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash -419265230, now seen corresponding path program 2 times [2019-08-05 11:16:04,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:04,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:16:04,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:16:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:05,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:05,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:05,035 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 6 states. [2019-08-05 11:16:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:05,118 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2019-08-05 11:16:05,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:05,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-08-05 11:16:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:05,120 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:16:05,120 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:16:05,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:16:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:16:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:16:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-08-05 11:16:05,126 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 34 [2019-08-05 11:16:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,127 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-08-05 11:16:05,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-08-05 11:16:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:16:05,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,128 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:16:05,129 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1360284398, now seen corresponding path program 3 times [2019-08-05 11:16:05,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-08-05 11:16:05,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:05,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:05,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:05,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:05,246 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 6 states. [2019-08-05 11:16:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:05,418 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-08-05 11:16:05,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:05,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-08-05 11:16:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:05,420 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:16:05,421 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:16:05,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:16:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:16:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:16:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 11:16:05,428 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 42 [2019-08-05 11:16:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,429 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 11:16:05,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 11:16:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:16:05,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,430 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 7, 7, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:16:05,431 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 858885764, now seen corresponding path program 4 times [2019-08-05 11:16:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-08-05 11:16:05,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:05,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:05,604 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2019-08-05 11:16:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:05,710 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-08-05 11:16:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:16:05,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-08-05 11:16:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:05,712 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:16:05,712 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:16:05,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:16:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-08-05 11:16:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:16:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-08-05 11:16:05,718 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 56 [2019-08-05 11:16:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:05,719 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-08-05 11:16:05,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-08-05 11:16:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:16:05,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:05,721 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:05,721 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1309813862, now seen corresponding path program 5 times [2019-08-05 11:16:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:05,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:05,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 222 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-08-05 11:16:05,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:05,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:05,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:05,891 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 8 states. [2019-08-05 11:16:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:06,291 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-08-05 11:16:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:06,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-08-05 11:16:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:06,293 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:16:06,294 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:16:06,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:16:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:16:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:16:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-08-05 11:16:06,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 70 [2019-08-05 11:16:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:06,302 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-08-05 11:16:06,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-08-05 11:16:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:16:06,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:06,305 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 13, 13, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:06,305 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1754705682, now seen corresponding path program 6 times [2019-08-05 11:16:06,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:06,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:16:06,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 291 proven. 8 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-08-05 11:16:06,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:06,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:06,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:06,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:06,444 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 7 states. [2019-08-05 11:16:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:06,709 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-08-05 11:16:06,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:06,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-08-05 11:16:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:06,712 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:16:06,712 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:16:06,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:16:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:16:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:16:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-08-05 11:16:06,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 86 [2019-08-05 11:16:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:06,719 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-08-05 11:16:06,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-08-05 11:16:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:16:06,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:06,721 INFO L399 BasicCegarLoop]: trace histogram [17, 12, 12, 12, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:16:06,721 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1290780916, now seen corresponding path program 7 times [2019-08-05 11:16:06,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:06,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:06,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-08-05 11:16:06,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:06,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:06,989 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 8 states. [2019-08-05 11:16:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,058 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-08-05 11:16:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:07,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-08-05 11:16:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,062 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:16:07,062 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:16:07,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:16:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-08-05 11:16:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:16:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-08-05 11:16:07,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 82 [2019-08-05 11:16:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,069 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-08-05 11:16:07,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-08-05 11:16:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:16:07,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:07,071 INFO L399 BasicCegarLoop]: trace histogram [21, 15, 15, 15, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:16:07,071 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash 5073320, now seen corresponding path program 8 times [2019-08-05 11:16:07,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:07,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:16:07,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 482 proven. 12 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-08-05 11:16:07,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:07,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:07,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:07,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:07,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:07,280 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 10 states. [2019-08-05 11:16:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:07,463 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-08-05 11:16:07,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:07,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-08-05 11:16:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:07,465 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:16:07,465 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:16:07,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:16:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:16:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:16:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-08-05 11:16:07,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 100 [2019-08-05 11:16:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:07,473 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-08-05 11:16:07,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-08-05 11:16:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:16:07,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:07,478 INFO L399 BasicCegarLoop]: trace histogram [25, 19, 19, 19, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:16:07,478 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -987542752, now seen corresponding path program 9 times [2019-08-05 11:16:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:07,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:16:07,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 617 proven. 19 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-08-05 11:16:07,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:07,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:07,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:16:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:16:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:07,672 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 9 states. [2019-08-05 11:16:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:08,159 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2019-08-05 11:16:08,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:16:08,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-08-05 11:16:08,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:08,162 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:16:08,162 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:16:08,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:16:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:16:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:16:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-08-05 11:16:08,171 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 116 [2019-08-05 11:16:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:08,171 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-08-05 11:16:08,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:16:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-08-05 11:16:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:16:08,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:08,173 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:16:08,173 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1867336578, now seen corresponding path program 10 times [2019-08-05 11:16:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:08,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:16:08,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-08-05 11:16:08,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:08,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:08,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:16:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:16:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:08,634 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 9 states. [2019-08-05 11:16:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:08,702 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-08-05 11:16:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:16:08,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-08-05 11:16:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:08,706 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:16:08,706 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:16:08,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:16:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-08-05 11:16:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:16:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-08-05 11:16:08,714 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 112 [2019-08-05 11:16:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:08,714 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-08-05 11:16:08,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:16:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-08-05 11:16:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 11:16:08,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:08,717 INFO L399 BasicCegarLoop]: trace histogram [29, 22, 22, 22, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:16:08,717 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -276969772, now seen corresponding path program 11 times [2019-08-05 11:16:08,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:08,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:16:08,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 885 proven. 20 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2019-08-05 11:16:08,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:08,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:16:08,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:16:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:16:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:08,942 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 12 states. [2019-08-05 11:16:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:09,073 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-08-05 11:16:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:09,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-08-05 11:16:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:09,075 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:16:09,075 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:16:09,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:16:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:16:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:16:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-08-05 11:16:09,086 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 134 [2019-08-05 11:16:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:09,086 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-08-05 11:16:09,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:16:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-08-05 11:16:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 11:16:09,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:09,088 INFO L399 BasicCegarLoop]: trace histogram [32, 25, 25, 25, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:16:09,089 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash -114638802, now seen corresponding path program 12 times [2019-08-05 11:16:09,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:09,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:16:09,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2019-08-05 11:16:09,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:09,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:09,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:09,669 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 10 states. [2019-08-05 11:16:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:09,799 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2019-08-05 11:16:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:09,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-08-05 11:16:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:09,802 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:16:09,802 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:16:09,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:16:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-08-05 11:16:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:16:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2019-08-05 11:16:09,809 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 146 [2019-08-05 11:16:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:09,810 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-08-05 11:16:09,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2019-08-05 11:16:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 11:16:09,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:09,812 INFO L399 BasicCegarLoop]: trace histogram [39, 31, 31, 31, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:16:09,813 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 300386492, now seen corresponding path program 13 times [2019-08-05 11:16:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:09,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:16:09,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 1461 proven. 35 refuted. 0 times theorem prover too weak. 1284 trivial. 0 not checked. [2019-08-05 11:16:10,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:10,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:16:10,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:16:10,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:16:10,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:10,229 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand 11 states. [2019-08-05 11:16:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:11,062 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2019-08-05 11:16:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:16:11,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 176 [2019-08-05 11:16:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:11,067 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:16:11,067 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:16:11,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:16:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:16:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-08-05 11:16:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:16:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-08-05 11:16:11,076 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 176 [2019-08-05 11:16:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:11,076 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-08-05 11:16:11,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:16:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-08-05 11:16:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 11:16:11,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:11,079 INFO L399 BasicCegarLoop]: trace histogram [38, 30, 30, 30, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:16:11,079 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1163648994, now seen corresponding path program 14 times [2019-08-05 11:16:11,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:11,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:16:11,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 1461 proven. 30 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2019-08-05 11:16:11,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:11,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:16:11,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:16:11,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:16:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:11,679 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 14 states. [2019-08-05 11:16:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:11,769 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2019-08-05 11:16:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:16:11,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 172 [2019-08-05 11:16:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:11,771 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:16:11,771 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:16:11,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:16:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:16:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:16:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-08-05 11:16:11,779 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 172 [2019-08-05 11:16:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:11,780 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-08-05 11:16:11,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:16:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-08-05 11:16:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 11:16:11,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:11,782 INFO L399 BasicCegarLoop]: trace histogram [41, 33, 33, 33, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:16:11,782 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash 43897848, now seen corresponding path program 15 times [2019-08-05 11:16:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:11,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:11,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2019-08-05 11:16:12,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:12,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:16:12,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:16:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:16:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:12,352 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 11 states. [2019-08-05 11:16:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:12,520 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-08-05 11:16:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:16:12,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2019-08-05 11:16:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:12,527 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:16:12,527 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:16:12,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:16:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:16:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:16:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2019-08-05 11:16:12,535 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 184 [2019-08-05 11:16:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:12,536 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2019-08-05 11:16:12,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:16:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2019-08-05 11:16:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-05 11:16:12,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:12,552 INFO L399 BasicCegarLoop]: trace histogram [48, 39, 39, 39, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:12,553 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1092842106, now seen corresponding path program 16 times [2019-08-05 11:16:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:12,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:16:12,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4242 backedges. 2240 proven. 42 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [2019-08-05 11:16:13,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:13,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:16:13,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:16:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:16:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:13,067 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 16 states. [2019-08-05 11:16:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:13,211 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-08-05 11:16:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:16:13,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 214 [2019-08-05 11:16:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:13,215 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:16:13,215 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:16:13,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:16:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:16:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:16:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2019-08-05 11:16:13,222 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 214 [2019-08-05 11:16:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:13,223 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-08-05 11:16:13,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:16:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2019-08-05 11:16:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-08-05 11:16:13,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:13,225 INFO L399 BasicCegarLoop]: trace histogram [52, 43, 43, 43, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:13,225 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:13,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1099196162, now seen corresponding path program 17 times [2019-08-05 11:16:13,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:13,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:16:13,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4998 backedges. 2855 proven. 82 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2019-08-05 11:16:13,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:13,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:16:13,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:16:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:16:13,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:13,517 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 15 states. [2019-08-05 11:16:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:14,763 INFO L93 Difference]: Finished difference Result 98 states and 176 transitions. [2019-08-05 11:16:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:16:14,764 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 230 [2019-08-05 11:16:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:14,767 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:16:14,767 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:16:14,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:16:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:16:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-08-05 11:16:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:16:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2019-08-05 11:16:14,776 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 230 [2019-08-05 11:16:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:14,776 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2019-08-05 11:16:14,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:16:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2019-08-05 11:16:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-05 11:16:14,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:14,778 INFO L399 BasicCegarLoop]: trace histogram [51, 42, 42, 42, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:14,779 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 561422048, now seen corresponding path program 18 times [2019-08-05 11:16:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:14,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:16:14,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4803 backedges. 805 proven. 56 refuted. 0 times theorem prover too weak. 3942 trivial. 0 not checked. [2019-08-05 11:16:15,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:15,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:16:15,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:16:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:16:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:15,202 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand 19 states. [2019-08-05 11:16:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:15,480 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2019-08-05 11:16:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:16:15,482 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-08-05 11:16:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:15,483 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:16:15,483 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:16:15,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:16:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:16:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:16:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2019-08-05 11:16:15,490 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 226 [2019-08-05 11:16:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:15,491 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2019-08-05 11:16:15,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:16:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2019-08-05 11:16:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-05 11:16:15,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:15,493 INFO L399 BasicCegarLoop]: trace histogram [54, 45, 45, 45, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:15,493 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1505727162, now seen corresponding path program 19 times [2019-08-05 11:16:15,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:15,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:15,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5400 backedges. 2937 proven. 113 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2019-08-05 11:16:15,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:15,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:16:15,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:16:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:16:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:15,754 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand 17 states. [2019-08-05 11:16:16,409 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 11:16:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:17,409 INFO L93 Difference]: Finished difference Result 117 states and 191 transitions. [2019-08-05 11:16:17,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:16:17,410 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 238 [2019-08-05 11:16:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:17,412 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:16:17,412 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:16:17,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:16:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:16:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2019-08-05 11:16:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:16:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2019-08-05 11:16:17,421 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 117 transitions. Word has length 238 [2019-08-05 11:16:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:17,421 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 117 transitions. [2019-08-05 11:16:17,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:16:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2019-08-05 11:16:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 11:16:17,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:17,423 INFO L399 BasicCegarLoop]: trace histogram [53, 44, 44, 44, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:17,424 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:17,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1981186916, now seen corresponding path program 20 times [2019-08-05 11:16:17,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:17,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:16:17,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5197 backedges. 909 proven. 72 refuted. 0 times theorem prover too weak. 4216 trivial. 0 not checked. [2019-08-05 11:16:17,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:17,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:16:17,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:16:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:16:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:16:17,854 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. Second operand 20 states. [2019-08-05 11:16:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:18,147 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2019-08-05 11:16:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:16:18,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 234 [2019-08-05 11:16:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:18,150 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:16:18,150 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:16:18,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:16:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:16:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:16:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:16:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-08-05 11:16:18,156 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 234 [2019-08-05 11:16:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:18,157 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-08-05 11:16:18,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:16:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-08-05 11:16:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-08-05 11:16:18,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:18,159 INFO L399 BasicCegarLoop]: trace histogram [55, 46, 46, 46, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:18,160 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 49647448, now seen corresponding path program 21 times [2019-08-05 11:16:18,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:18,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:16:18,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5607 backedges. 2405 proven. 149 refuted. 0 times theorem prover too weak. 3053 trivial. 0 not checked. [2019-08-05 11:16:18,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:18,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:16:18,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:16:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:16:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:18,714 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 19 states. [2019-08-05 11:16:19,733 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:16:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:21,561 INFO L93 Difference]: Finished difference Result 134 states and 224 transitions. [2019-08-05 11:16:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:16:21,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 242 [2019-08-05 11:16:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:21,563 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:16:21,563 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:16:21,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=746, Invalid=3036, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:16:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:16:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 97. [2019-08-05 11:16:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:16:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-08-05 11:16:21,572 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 242 [2019-08-05 11:16:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:21,573 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-08-05 11:16:21,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:16:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2019-08-05 11:16:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-05 11:16:21,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:21,575 INFO L399 BasicCegarLoop]: trace histogram [54, 45, 45, 45, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:16:21,575 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1610210874, now seen corresponding path program 22 times [2019-08-05 11:16:21,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:21,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:16:21,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5400 backedges. 2007 proven. 660 refuted. 0 times theorem prover too weak. 2733 trivial. 0 not checked. [2019-08-05 11:16:22,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:22,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:16:22,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:16:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:16:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:22,286 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand 22 states. [2019-08-05 11:16:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:22,810 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2019-08-05 11:16:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:16:22,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 238 [2019-08-05 11:16:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:22,812 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:16:22,812 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:16:22,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:16:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:16:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:16:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:16:22,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2019-08-05 11:16:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:22,814 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:16:22,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:16:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:16:22,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:16:22,819 INFO L202 PluginConnector]: Adding new model CallNTimes.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:16:22 BoogieIcfgContainer [2019-08-05 11:16:22,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:16:22,822 INFO L168 Benchmark]: Toolchain (without parser) took 19747.13 ms. Allocated memory was 135.8 MB in the beginning and 367.0 MB in the end (delta: 231.2 MB). Free memory was 113.3 MB in the beginning and 198.6 MB in the end (delta: -85.3 MB). Peak memory consumption was 145.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:22,823 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory was 114.5 MB in the beginning and 114.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:22,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.68 ms. Allocated memory is still 135.8 MB. Free memory was 113.3 MB in the beginning and 111.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:22,825 INFO L168 Benchmark]: Boogie Preprocessor took 27.33 ms. Allocated memory is still 135.8 MB. Free memory was 111.3 MB in the beginning and 110.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 11:16:22,825 INFO L168 Benchmark]: RCFGBuilder took 315.24 ms. Allocated memory is still 135.8 MB. Free memory was 110.2 MB in the beginning and 100.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:22,826 INFO L168 Benchmark]: TraceAbstraction took 19360.96 ms. Allocated memory was 135.8 MB in the beginning and 367.0 MB in the end (delta: 231.2 MB). Free memory was 99.9 MB in the beginning and 198.6 MB in the end (delta: -98.7 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:22,830 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 135.8 MB. Free memory was 114.5 MB in the beginning and 114.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.68 ms. Allocated memory is still 135.8 MB. Free memory was 113.3 MB in the beginning and 111.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.33 ms. Allocated memory is still 135.8 MB. Free memory was 111.3 MB in the beginning and 110.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 315.24 ms. Allocated memory is still 135.8 MB. Free memory was 110.2 MB in the beginning and 100.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19360.96 ms. Allocated memory was 135.8 MB in the beginning and 367.0 MB in the end (delta: 231.2 MB). Free memory was 99.9 MB in the beginning and 198.6 MB in the end (delta: -98.7 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 2 error locations. SAFE Result, 19.3s OverallTime, 26 OverallIterations, 55 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 442 SDtfs, 456 SDslu, 1247 SDs, 0 SdLazy, 5137 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3306 GetRequests, 2953 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2191 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=25, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 86 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 3204 NumberOfCodeBlocks, 3204 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3178 ConstructedInterpolants, 0 QuantifiedInterpolants, 857702 SizeOfPredicates, 18 NumberOfNonLiveVariables, 8162 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 50718/52312 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...