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 -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:18:53,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:18:53,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:18:53,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:18:53,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:18:53,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:18:53,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:18:53,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:18:53,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:18:53,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:18:53,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:18:53,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:18:53,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:18:53,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:18:53,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:18:53,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:18:53,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:18:53,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:18:53,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:18:53,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:18:53,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:18:53,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:18:53,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:18:53,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:18:53,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:18:53,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:18:53,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:18:53,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:18:53,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:18:53,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:18:53,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:18:53,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:18:53,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:18:53,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:18:53,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:18:53,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:18:53,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-08 14:18:53,094 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:18:53,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:18:53,095 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:18:53,095 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:18:53,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:18:53,096 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:18:53,096 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:18:53,096 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:18:53,096 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:18:53,096 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:18:53,097 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:18:53,097 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:18:53,097 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:18:53,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:18:53,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:18:53,098 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:18:53,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:18:53,099 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:18:53,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:18:53,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:18:53,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:18:53,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:18:53,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:18:53,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:18:53,100 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:18:53,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:18:53,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:18:53,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:18:53,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:18:53,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:18:53,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:53,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:18:53,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:18:53,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:18:53,102 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:18:53,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:18:53,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:18:53,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:18:53,103 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:18:53,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:18:53,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:18:53,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:18:53,172 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:18:53,172 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:18:53,173 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl [2019-01-08 14:18:53,173 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl' [2019-01-08 14:18:53,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:18:53,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:18:53,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:53,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:18:53,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:18:53,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:53,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:18:53,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:18:53,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:18:53,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/1) ... [2019-01-08 14:18:53,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:18:53,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:18:53,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:18:53,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:18:53,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (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:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:18:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:18:53,689 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:18:53,690 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-08 14:18:53,691 INFO L202 PluginConnector]: Adding new model veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:53 BoogieIcfgContainer [2019-01-08 14:18:53,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:18:53,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:18:53,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:18:53,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:18:53,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:53" (1/2) ... [2019-01-08 14:18:53,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95729e6 and model type veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:18:53, skipping insertion in model container [2019-01-08 14:18:53,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:53" (2/2) ... [2019-01-08 14:18:53,702 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc__loop.i_2.bpl [2019-01-08 14:18:53,714 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:18:53,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 14:18:53,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 14:18:53,788 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:18:53,789 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:18:53,789 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:18:53,789 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:18:53,789 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:18:53,790 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:18:53,790 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:18:53,790 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:18:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 14:18:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:18:53,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:53,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:18:53,820 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-01-08 14:18:53,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:53,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:53,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:53,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:53,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:18:54,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:18:54,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:18:54,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:54,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:18:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:18:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:18:54,210 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-01-08 14:18:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:54,315 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-08 14:18:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:18:54,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:18:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:54,331 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:18:54,331 INFO L226 Difference]: Without dead ends: 8 [2019-01-08 14:18:54,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:18:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-08 14:18:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-08 14:18:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 14:18:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-08 14:18:54,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-01-08 14:18:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:54,378 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-08 14:18:54,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:18:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-08 14:18:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:18:54,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:54,379 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:18:54,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-01-08 14:18:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:54,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:54,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:54,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:18:54,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:54,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:54,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:18:54,784 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-01-08 14:18:54,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:18:54,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:19:14,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:19:14,963 INFO L272 AbstractInterpreter]: Visited 5 different actions 10 times. Merged at 4 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:19:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:14,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:19:14,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:14,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:14,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:14,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:15,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:15,440 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2019-01-08 14:19:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:15,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:15,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:15,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-08 14:19:15,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:15,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:19:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:19:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:19:15,913 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2019-01-08 14:19:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:16,074 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-08 14:19:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:19:16,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:19:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:16,076 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:19:16,076 INFO L226 Difference]: Without dead ends: 10 [2019-01-08 14:19:16,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:19:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-08 14:19:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-08 14:19:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 14:19:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-08 14:19:16,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-01-08 14:19:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:16,083 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-08 14:19:16,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:19:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-08 14:19:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:19:16,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:16,084 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-01-08 14:19:16,084 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-01-08 14:19:16,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:16,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:16,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:16,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:19:16,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-08 14:19:16,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:19:16,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:19:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:19:16,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:19:16,193 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-01-08 14:19:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:16,218 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-08 14:19:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:19:16,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-08 14:19:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:16,220 INFO L225 Difference]: With dead ends: 10 [2019-01-08 14:19:16,220 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:19:16,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-08 14:19:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:19:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:19:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:19:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:19:16,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-01-08 14:19:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:16,223 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:19:16,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:19:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:19:16,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:19:16,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:19:16,435 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 12 83) no Hoare annotation was computed. [2019-01-08 14:19:16,435 INFO L444 ceAbstractionStarter]: At program point L64(lines 64 77) the Hoare annotation is: (let ((.cse1 (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))) (or (let ((.cse0 (+ ULTIMATE.start_glob2_~p~4.offset 4))) (and (<= .cse0 ~tmp.offset) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= ULTIMATE.start_glob2_~pathlim.offset .cse0) .cse1)) (and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (<= ULTIMATE.start_glob2_~pathlim.offset ULTIMATE.start_glob2_~p~4.offset) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1))) [2019-01-08 14:19:16,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 12 83) no Hoare annotation was computed. [2019-01-08 14:19:16,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 12 83) no Hoare annotation was computed. [2019-01-08 14:19:16,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2019-01-08 14:19:16,436 INFO L444 ceAbstractionStarter]: At program point L80(lines 80 81) the Hoare annotation is: false [2019-01-08 14:19:16,436 INFO L444 ceAbstractionStarter]: At program point L76(lines 57 76) the Hoare annotation is: (let ((.cse1 (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))) (or (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_glob2_~pathlim.offset 4) ULTIMATE.start_glob2_~p~4.offset)) (let ((.cse0 (+ ULTIMATE.start_glob2_~p~4.offset 4))) (and (<= .cse0 ~tmp.offset) (<= ULTIMATE.start_glob2_~pathlim.offset .cse0) .cse1)) (and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (<= ULTIMATE.start_glob2_~pathlim.offset ULTIMATE.start_glob2_~p~4.offset) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse1))) [2019-01-08 14:19:16,447 INFO L202 PluginConnector]: Adding new model veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:19:16 BoogieIcfgContainer [2019-01-08 14:19:16,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:19:16,449 INFO L168 Benchmark]: Toolchain (without parser) took 23227.53 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 541.4 MB. Max. memory is 7.1 GB. [2019-01-08 14:19:16,450 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:19:16,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:19:16,452 INFO L168 Benchmark]: Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:19:16,453 INFO L168 Benchmark]: RCFGBuilder took 387.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:19:16,454 INFO L168 Benchmark]: TraceAbstraction took 22755.19 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 520.2 MB. Max. memory is 7.1 GB. [2019-01-08 14:19:16,459 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 387.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22755.19 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 520.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 82]: 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 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((glob2_~p~4.offset + 4 <= ~tmp.offset && __VERIFIER_assert_~cond == 1) && glob2_~pathlim.offset <= glob2_~p~4.offset + 4) && ~tmp.base == glob2_~p~4.base) || (((glob2_~p~4.offset <= ~tmp.offset && glob2_~pathlim.offset <= glob2_~p~4.offset) && 1 == __VERIFIER_assert_~cond) && ~tmp.base == glob2_~p~4.base) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert_~cond) && glob2_~pathlim.offset + 4 <= glob2_~p~4.offset) || ((glob2_~p~4.offset + 4 <= ~tmp.offset && glob2_~pathlim.offset <= glob2_~p~4.offset + 4) && ~tmp.base == glob2_~p~4.base)) || (((glob2_~p~4.offset <= ~tmp.offset && glob2_~pathlim.offset <= glob2_~p~4.offset) && 1 == __VERIFIER_assert_~cond) && ~tmp.base == glob2_~p~4.base) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 22.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 2 SDslu, 12 SDs, 0 SdLazy, 28 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 20.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 70 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 735 SizeOfPredicates, 14 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...