java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:16,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:16,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:16,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:16,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:16,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:16,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:16,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:16,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:16,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:16,548 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:16,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:16,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:16,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:16,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:16,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:16,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:16,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:16,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:16,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:16,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:16,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:16,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:16,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:16,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:16,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:16,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:16,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:16,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:16,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:16,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:16,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:16,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:16,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:16,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:16,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:16,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:16,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:16,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:16,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:16,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:16,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:16,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:16,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:16,652 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:16,652 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:16,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl [2019-08-05 10:16:16,653 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl' [2019-08-05 10:16:16,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:16,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:16,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:16,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:16,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:16,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:16,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:16,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:16,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:16,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... [2019-08-05 10:16:16,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:16,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:16,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:16,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:16,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:16:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:16,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:17,651 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:16:17,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:17,956 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:17,957 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:17 BoogieIcfgContainer [2019-08-05 10:16:17,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:17,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:17,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:17,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:17,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:16" (1/2) ... [2019-08-05 10:16:17,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd4ee98 and model type s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:17, skipping insertion in model container [2019-08-05 10:16:17,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:17" (2/2) ... [2019-08-05 10:16:17,966 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil.c_21.bpl [2019-08-05 10:16:17,976 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:17,985 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:18,001 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:18,028 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:18,029 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:18,029 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:18,029 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:18,029 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:18,030 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:18,030 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:18,030 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:18,030 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 10:16:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:18,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:18,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:18,056 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1918575661, now seen corresponding path program 1 times [2019-08-05 10:16:18,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:18,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:18,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:18,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:18,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:18,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:18,318 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 10:16:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:18,508 INFO L93 Difference]: Finished difference Result 25 states and 38 transitions. [2019-08-05 10:16:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:18,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 10:16:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:18,522 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:16:18,523 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:16:18,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:16:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:16:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:16:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2019-08-05 10:16:18,570 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 10 [2019-08-05 10:16:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:18,570 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2019-08-05 10:16:18,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2019-08-05 10:16:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:16:18,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:18,571 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:18,572 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 21316971, now seen corresponding path program 1 times [2019-08-05 10:16:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:18,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:18,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:18,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:18,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:18,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:18,664 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 3 states. [2019-08-05 10:16:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:18,859 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-08-05 10:16:18,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:18,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:16:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:18,863 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:16:18,863 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:16:18,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:16:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:16:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:16:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:16:18,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 14 [2019-08-05 10:16:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:18,874 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:16:18,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:16:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:16:18,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:18,876 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:18,876 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash -72278430, now seen corresponding path program 1 times [2019-08-05 10:16:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:18,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:18,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:16:19,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:19,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:19,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:19,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:19,030 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 3 states. [2019-08-05 10:16:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:19,211 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-08-05 10:16:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:19,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:16:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:19,215 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:16:19,215 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:16:19,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:16:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:16:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:16:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2019-08-05 10:16:19,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 19 [2019-08-05 10:16:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:19,224 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2019-08-05 10:16:19,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2019-08-05 10:16:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:16:19,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:19,225 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:19,226 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash 481337912, now seen corresponding path program 1 times [2019-08-05 10:16:19,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:19,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:19,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:16:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:19,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:19,308 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand 3 states. [2019-08-05 10:16:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:19,467 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-08-05 10:16:19,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:19,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:16:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:19,470 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:16:19,470 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:16:19,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:16:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:16:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:16:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-08-05 10:16:19,478 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 25 [2019-08-05 10:16:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:19,478 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-08-05 10:16:19,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-08-05 10:16:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:16:19,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:19,480 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:19,480 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash -74853210, now seen corresponding path program 1 times [2019-08-05 10:16:19,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:19,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:19,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 10:16:19,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:19,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:19,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:19,590 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 3 states. [2019-08-05 10:16:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:19,687 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-08-05 10:16:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:19,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-05 10:16:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:19,690 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:16:19,690 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:16:19,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:16:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:16:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:16:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-08-05 10:16:19,697 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 32 [2019-08-05 10:16:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:19,697 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-08-05 10:16:19,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-08-05 10:16:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:16:19,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:19,699 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:19,699 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1323188226, now seen corresponding path program 1 times [2019-08-05 10:16:19,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:19,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:19,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:19,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:19,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:19,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:19,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:19,970 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 6 states. [2019-08-05 10:16:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:20,148 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2019-08-05 10:16:20,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:20,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-08-05 10:16:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:20,150 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:16:20,150 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:16:20,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:16:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:16:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:16:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2019-08-05 10:16:20,161 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 35 [2019-08-05 10:16:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:20,161 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2019-08-05 10:16:20,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2019-08-05 10:16:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:16:20,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:20,163 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:20,164 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:20,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1156730742, now seen corresponding path program 2 times [2019-08-05 10:16:20,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:20,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:20,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 10:16:20,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:20,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:20,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:20,259 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand 3 states. [2019-08-05 10:16:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:20,372 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2019-08-05 10:16:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:20,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-08-05 10:16:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:20,376 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:16:20,376 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:16:20,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:16:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-08-05 10:16:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:16:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2019-08-05 10:16:20,387 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 48 [2019-08-05 10:16:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:20,388 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2019-08-05 10:16:20,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2019-08-05 10:16:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:16:20,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:20,391 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:20,391 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1400314932, now seen corresponding path program 3 times [2019-08-05 10:16:20,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:20,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:20,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:16:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:20,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:20,483 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 3 states. [2019-08-05 10:16:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:20,859 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2019-08-05 10:16:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:20,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-08-05 10:16:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:20,861 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:16:20,861 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:16:20,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:16:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2019-08-05 10:16:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:16:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 180 transitions. [2019-08-05 10:16:20,872 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 180 transitions. Word has length 51 [2019-08-05 10:16:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:20,873 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 180 transitions. [2019-08-05 10:16:20,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 180 transitions. [2019-08-05 10:16:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:16:20,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:20,875 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:20,875 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash -382994581, now seen corresponding path program 1 times [2019-08-05 10:16:20,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:20,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:20,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:16:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:20,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:20,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:20,964 INFO L87 Difference]: Start difference. First operand 145 states and 180 transitions. Second operand 3 states. [2019-08-05 10:16:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:21,049 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2019-08-05 10:16:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:21,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:16:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:21,052 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:16:21,052 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:16:21,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:16:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:16:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:16:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 183 transitions. [2019-08-05 10:16:21,061 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 183 transitions. Word has length 58 [2019-08-05 10:16:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:21,061 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 183 transitions. [2019-08-05 10:16:21,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 183 transitions. [2019-08-05 10:16:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:16:21,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:21,063 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:21,063 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1999447894, now seen corresponding path program 1 times [2019-08-05 10:16:21,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:21,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:21,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:16:21,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:21,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:21,163 INFO L87 Difference]: Start difference. First operand 148 states and 183 transitions. Second operand 3 states. [2019-08-05 10:16:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:21,587 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2019-08-05 10:16:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:21,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:16:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:21,591 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:16:21,591 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:16:21,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:16:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2019-08-05 10:16:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:16:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2019-08-05 10:16:21,599 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 60 [2019-08-05 10:16:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:21,600 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2019-08-05 10:16:21,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2019-08-05 10:16:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:16:21,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:21,602 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:21,602 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:21,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1177512501, now seen corresponding path program 1 times [2019-08-05 10:16:21,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:21,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:21,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:16:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:21,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:21,704 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand 3 states. [2019-08-05 10:16:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:21,869 INFO L93 Difference]: Finished difference Result 175 states and 210 transitions. [2019-08-05 10:16:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:21,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-05 10:16:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:21,873 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:16:21,873 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:16:21,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:16:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-05 10:16:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:16:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 210 transitions. [2019-08-05 10:16:21,880 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 210 transitions. Word has length 67 [2019-08-05 10:16:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:21,881 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 210 transitions. [2019-08-05 10:16:21,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2019-08-05 10:16:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:16:21,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:21,883 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:21,883 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2041254582, now seen corresponding path program 1 times [2019-08-05 10:16:21,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:21,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:21,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 10:16:21,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:21,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:21,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:21,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:21,943 INFO L87 Difference]: Start difference. First operand 175 states and 210 transitions. Second operand 3 states. [2019-08-05 10:16:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:22,079 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2019-08-05 10:16:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:22,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-08-05 10:16:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:22,081 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:16:22,082 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:16:22,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:16:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2019-08-05 10:16:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:16:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 207 transitions. [2019-08-05 10:16:22,088 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 207 transitions. Word has length 69 [2019-08-05 10:16:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:22,088 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 207 transitions. [2019-08-05 10:16:22,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 207 transitions. [2019-08-05 10:16:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:16:22,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:22,091 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:22,091 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:22,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash 353372841, now seen corresponding path program 1 times [2019-08-05 10:16:22,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:22,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:16:22,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:22,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:22,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:22,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:22,266 INFO L87 Difference]: Start difference. First operand 175 states and 207 transitions. Second operand 4 states. [2019-08-05 10:16:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:22,432 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2019-08-05 10:16:22,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:22,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-08-05 10:16:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:22,434 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:16:22,434 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:16:22,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:16:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-08-05 10:16:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:16:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2019-08-05 10:16:22,442 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 76 [2019-08-05 10:16:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:22,443 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2019-08-05 10:16:22,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2019-08-05 10:16:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:16:22,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:22,444 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:22,444 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1757972790, now seen corresponding path program 2 times [2019-08-05 10:16:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:22,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:22,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:22,951 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:16:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:23,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:23,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:23,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:23,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:23,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:23,072 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand 5 states. [2019-08-05 10:16:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:23,607 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2019-08-05 10:16:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:23,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-08-05 10:16:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:23,609 INFO L225 Difference]: With dead ends: 244 [2019-08-05 10:16:23,609 INFO L226 Difference]: Without dead ends: 244 [2019-08-05 10:16:23,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-08-05 10:16:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-08-05 10:16:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 10:16:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2019-08-05 10:16:23,615 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 86 [2019-08-05 10:16:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:23,615 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2019-08-05 10:16:23,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2019-08-05 10:16:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:16:23,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:23,617 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:23,617 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2122125909, now seen corresponding path program 3 times [2019-08-05 10:16:23,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:23,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:16:23,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:24,000 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:16:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:24,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:24,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:24,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:24,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:24,211 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand 6 states. [2019-08-05 10:16:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:24,486 INFO L93 Difference]: Finished difference Result 274 states and 306 transitions. [2019-08-05 10:16:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:24,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-08-05 10:16:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:24,489 INFO L225 Difference]: With dead ends: 274 [2019-08-05 10:16:24,490 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 10:16:24,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 10:16:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 268. [2019-08-05 10:16:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:16:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 300 transitions. [2019-08-05 10:16:24,497 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 300 transitions. Word has length 96 [2019-08-05 10:16:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:24,498 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 300 transitions. [2019-08-05 10:16:24,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 300 transitions. [2019-08-05 10:16:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:16:24,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:24,500 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:24,500 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:24,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1854668980, now seen corresponding path program 4 times [2019-08-05 10:16:24,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:24,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:16:24,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:25,271 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:16:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:25,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:25,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:25,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:25,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:25,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:25,333 INFO L87 Difference]: Start difference. First operand 268 states and 300 transitions. Second operand 7 states. [2019-08-05 10:16:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:25,726 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2019-08-05 10:16:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:25,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-08-05 10:16:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:25,727 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:16:25,727 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:16:25,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:16:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:16:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:16:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:16:25,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-08-05 10:16:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:25,730 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:16:25,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:16:25,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:16:25,736 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:25 BoogieIcfgContainer [2019-08-05 10:16:25,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:25,738 INFO L168 Benchmark]: Toolchain (without parser) took 9016.58 ms. Allocated memory was 132.6 MB in the beginning and 238.6 MB in the end (delta: 105.9 MB). Free memory was 108.9 MB in the beginning and 91.0 MB in the end (delta: 17.9 MB). Peak memory consumption was 123.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:25,739 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:16:25,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.98 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:25,741 INFO L168 Benchmark]: Boogie Preprocessor took 60.36 ms. Allocated memory is still 132.6 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:25,742 INFO L168 Benchmark]: RCFGBuilder took 1118.98 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 66.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:25,743 INFO L168 Benchmark]: TraceAbstraction took 7777.56 ms. Allocated memory was 132.6 MB in the beginning and 238.6 MB in the end (delta: 105.9 MB). Free memory was 65.9 MB in the beginning and 91.0 MB in the end (delta: -25.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:25,747 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.23 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 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 54.98 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.36 ms. Allocated memory is still 132.6 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1118.98 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 66.3 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7777.56 ms. Allocated memory was 132.6 MB in the beginning and 238.6 MB in the end (delta: 105.9 MB). Free memory was 65.9 MB in the beginning and 91.0 MB in the end (delta: -25.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 473]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 7.7s OverallTime, 16 OverallIterations, 14 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 305 SDtfs, 83 SDslu, 168 SDs, 0 SdLazy, 1023 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=15, 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, 16 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 852 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 296306 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4876 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 2694/2888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...