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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:59:17,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:59:17,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:59:17,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:59:17,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:59:17,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:59:17,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:59:17,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:59:17,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:59:17,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:59:17,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:59:17,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:59:17,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:59:17,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:59:17,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:59:17,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:59:17,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:59:17,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:59:17,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:59:17,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:59:17,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:59:17,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:59:17,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:59:17,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:59:17,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:59:17,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:59:17,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:59:17,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:59:17,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:59:17,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:59:17,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:59:17,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:59:17,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:59:17,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:59:17,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:59:17,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:59:17,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:59:17,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:59:17,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:59:17,638 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:59:17,638 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:59:17,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:59:17,639 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:59:17,639 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:59:17,639 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:59:17,640 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:59:17,640 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:59:17,640 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:59:17,640 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:59:17,640 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:59:17,640 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:59:17,641 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:59:17,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:59:17,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:59:17,642 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:59:17,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:59:17,644 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:59:17,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:59:17,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:59:17,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:59:17,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:59:17,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:59:17,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:59:17,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:59:17,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:59:17,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:59:17,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:59:17,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:59:17,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:59:17,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:59:17,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:59:17,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:59:17,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:59:17,648 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:59:17,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:59:17,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:59:17,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:59:17,649 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:59:17,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:59:17,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:59:17,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:59:17,723 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:59:17,723 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:59:17,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2018-12-03 16:59:17,725 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2018-12-03 16:59:17,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:59:17,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:59:17,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:59:17,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:59:17,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:59:17,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,799 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:59:17,800 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:59:17,800 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:59:17,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:59:17,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:59:17,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:59:17,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:59:17,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/1) ... [2018-12-03 16:59:17,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:59:17,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:59:17,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:59:17,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:59:17,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (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:2024 -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:2024 -smt2 -in -t:2000 [2018-12-03 16:59:17,893 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:59:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:59:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:59:18,116 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:59:18,116 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:59:18,117 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:59:18 BoogieIcfgContainer [2018-12-03 16:59:18,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:59:18,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:59:18,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:59:18,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:59:18,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:17" (1/2) ... [2018-12-03 16:59:18,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622990af and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:59:18, skipping insertion in model container [2018-12-03 16:59:18,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:59:18" (2/2) ... [2018-12-03 16:59:18,125 INFO L112 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bpl [2018-12-03 16:59:18,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:59:18,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:59:18,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:59:18,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:59:18,198 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:59:18,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:59:18,199 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:59:18,199 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:59:18,199 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:59:18,199 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:59:18,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:59:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:59:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:59:18,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:18,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:59:18,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:18,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-03 16:59:18,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:59:18,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:59:18,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:59:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:59:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:59:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:59:18,411 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:59:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:18,485 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:59:18,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:59:18,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:59:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:18,503 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:59:18,503 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:59:18,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:59:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:59:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:59:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:59:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:59:18,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:59:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:18,541 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:59:18,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:59:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:59:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:59:18,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:18,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:59:18,542 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:18,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-03 16:59:18,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:18,812 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-03 16:59:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:18,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:18,826 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:59:18,828 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-03 16:59:18,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:59:18,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:59:20,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:59:20,132 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:59:20,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:20,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:59:20,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:20,146 INFO L192 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 [2018-12-03 16:59:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:20,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:20,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:20,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 16:59:20,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:59:20,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:59:20,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 16:59:20,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-03 16:59:20,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:59:20,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:59:20,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2018-12-03 16:59:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:20,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:20,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:20,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2018-12-03 16:59:20,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:20,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:59:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:59:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:20,447 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 16:59:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:20,659 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-12-03 16:59:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:59:20,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 16:59:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:20,662 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:59:20,662 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:59:20,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:59:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:59:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:59:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:59:20,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-03 16:59:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:20,667 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:59:20,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:59:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:59:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:59:20,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:20,668 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:59:20,668 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:20,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 2 times [2018-12-03 16:59:20,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:20,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:21,013 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 10 [2018-12-03 16:59:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:59:21,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:21,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:21,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:21,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:21,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:21,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:21,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:21,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:21,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:59:21,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:21,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:21,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 16:59:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 16:59:21,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:59:21,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-03 16:59:21,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2018-12-03 16:59:21,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-03 16:59:21,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 16:59:21,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:69 [2018-12-03 16:59:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:21,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2018-12-03 16:59:21,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:59:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:59:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:21,815 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 9 states. [2018-12-03 16:59:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:21,908 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:59:21,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:59:21,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-03 16:59:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:21,908 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:59:21,908 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:59:21,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:59:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:59:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:59:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:59:21,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-03 16:59:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:21,910 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:59:21,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:59:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:59:21,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:59:21,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:59:21,992 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 17 19) the Hoare annotation is: (and (< i (+ end 1)) (= 42 (select a end))) [2018-12-03 16:59:21,992 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 21) no Hoare annotation was computed. [2018-12-03 16:59:21,992 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2018-12-03 16:59:21,992 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2018-12-03 16:59:21,993 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-03 16:59:21,993 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 20) no Hoare annotation was computed. [2018-12-03 16:59:22,001 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:59:22 BoogieIcfgContainer [2018-12-03 16:59:22,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:59:22,001 INFO L168 Benchmark]: Toolchain (without parser) took 4242.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -641.5 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:59:22,003 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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. [2018-12-03 16:59:22,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.00 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. [2018-12-03 16:59:22,004 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 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. [2018-12-03 16:59:22,004 INFO L168 Benchmark]: RCFGBuilder took 291.27 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. [2018-12-03 16:59:22,005 INFO L168 Benchmark]: TraceAbstraction took 3883.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -662.7 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:59:22,009 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.20 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 42.00 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 22.72 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 291.27 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 3883.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 699.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -662.7 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i < end + 1 && 42 == a[end] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 30 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 1 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 26 ConstructedInterpolants, 4 QuantifiedInterpolants, 1239 SizeOfPredicates, 2 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...