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_camel.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:52,951 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:52,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:52,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:52,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:52,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:52,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:52,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:52,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:52,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:52,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:52,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:52,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:52,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:52,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:52,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:52,984 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:52,986 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:52,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:52,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:52,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:52,994 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:52,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:52,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:52,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:53,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:53,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:53,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:53,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:53,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:53,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:53,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:53,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:53,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:53,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:53,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:53,013 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:53,033 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:53,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:53,035 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:53,035 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:53,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:53,035 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:53,035 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:53,036 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:53,036 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:53,036 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:53,036 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:53,036 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:53,037 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:53,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:53,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:53,038 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:53,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:53,040 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:53,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:53,041 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:53,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:53,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:53,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:53,042 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:53,042 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:53,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:53,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:53,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:53,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:53,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:53,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:53,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:53,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:53,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:53,045 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:53,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:53,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:53,045 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:53,046 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:53,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:53,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:53,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:53,117 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:53,117 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:53,119 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-03-04 16:23:53,119 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-03-04 16:23:53,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:53,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:53,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:53,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:53,156 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:53,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,197 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:23:53,198 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:23:53,198 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:23:53,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:53,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:53,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:53,201 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:53,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/1) ... [2019-03-04 16:23:53,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:53,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:53,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:53,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:53,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23: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: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 [2019-03-04 16:23:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-03-04 16:23:53,292 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-03-04 16:23:53,451 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:23:53,451 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-03-04 16:23:53,452 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:53 BoogieIcfgContainer [2019-03-04 16:23:53,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:53,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:53,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:53,457 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:53,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:53" (1/2) ... [2019-03-04 16:23:53,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d083a2 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:53, skipping insertion in model container [2019-03-04 16:23:53,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:53" (2/2) ... [2019-03-04 16:23:53,461 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-03-04 16:23:53,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:53,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:53,498 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:53,528 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:53,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:53,529 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:53,530 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:53,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:53,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:53,530 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:53,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:53,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-03-04 16:23:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:23:53,551 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:53,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:23:53,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-03-04 16:23:53,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:53,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:53,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:53,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:53,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:23:53,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:53,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:53,785 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-03-04 16:23:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:53,816 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-03-04 16:23:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:53,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:23:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:53,829 INFO L225 Difference]: With dead ends: 7 [2019-03-04 16:23:53,829 INFO L226 Difference]: Without dead ends: 4 [2019-03-04 16:23:53,833 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 [2019-03-04 16:23:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-03-04 16:23:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-03-04 16:23:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-03-04 16:23:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-03-04 16:23:53,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-03-04 16:23:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:53,868 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-03-04 16:23:53,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-03-04 16:23:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:23:53,869 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:53,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:23:53,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:53,870 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-03-04 16:23:53,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:53,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:53,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:53,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:53,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:53,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:53,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:53,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:23:54,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:54,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-03-04 16:23:54,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:54,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:54,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:54,073 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-03-04 16:23:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:54,124 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-03-04 16:23:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:23:54,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:23:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:54,125 INFO L225 Difference]: With dead ends: 6 [2019-03-04 16:23:54,126 INFO L226 Difference]: Without dead ends: 5 [2019-03-04 16:23:54,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-03-04 16:23:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-03-04 16:23:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-03-04 16:23:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-03-04 16:23:54,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-03-04 16:23:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:54,130 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-03-04 16:23:54,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-03-04 16:23:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:54,131 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,131 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-03-04 16:23:54,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-03-04 16:23:54,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:54,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-03-04 16:23:54,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:54,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:54,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:54,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:23:54,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-03-04 16:23:54,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:23:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:23:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:54,261 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-03-04 16:23:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:54,312 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-03-04 16:23:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:54,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:23:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:54,314 INFO L225 Difference]: With dead ends: 7 [2019-03-04 16:23:54,314 INFO L226 Difference]: Without dead ends: 6 [2019-03-04 16:23:54,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-04 16:23:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-03-04 16:23:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-03-04 16:23:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:23:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-03-04 16:23:54,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-03-04 16:23:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:54,320 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-03-04 16:23:54,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:23:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-03-04 16:23:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:23:54,322 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,322 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-03-04 16:23:54,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-03-04 16:23:54,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:54,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:54,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:23:54,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:54,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:23:54,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:54,500 INFO L171 IndexEqualityManager]: detected equality via solver [2019-03-04 16:23:54,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-03-04 16:23:54,508 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:54,569 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:54,569 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-03-04 16:23:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:54,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:54,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:23:54,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:23:54,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:23:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:54,621 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2019-03-04 16:23:54,803 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-03-04 16:23:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,007 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-03-04 16:23:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:55,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:23:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,008 INFO L225 Difference]: With dead ends: 7 [2019-03-04 16:23:55,009 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:23:55,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:23:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:23:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:23:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:23:55,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-03-04 16:23:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,011 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:23:55,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:23:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:23:55,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:23:55,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:23:55,456 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2019-03-04 16:23:55,460 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-03-04 16:23:55,461 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 12 25) the Hoare annotation is: (or (and (< 4 proc_j) (< proc_j 6) (<= proc_i 999) (<= (select proc_a 5) 1000)) (<= proc_i 0)) [2019-03-04 16:23:55,461 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-03-04 16:23:55,461 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-03-04 16:23:55,472 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:23:55 BoogieIcfgContainer [2019-03-04 16:23:55,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:23:55,474 INFO L168 Benchmark]: Toolchain (without parser) took 2320.46 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 107.7 MB in the beginning and 116.7 MB in the end (delta: -9.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:55,475 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:23:55,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.09 ms. Allocated memory is still 140.0 MB. Free memory was 107.7 MB in the beginning and 105.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:55,477 INFO L168 Benchmark]: Boogie Preprocessor took 23.90 ms. Allocated memory is still 140.0 MB. Free memory was 105.7 MB in the beginning and 104.8 MB in the end (delta: 933.6 kB). Peak memory consumption was 933.6 kB. Max. memory is 7.1 GB. [2019-03-04 16:23:55,478 INFO L168 Benchmark]: RCFGBuilder took 227.61 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 96.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:55,479 INFO L168 Benchmark]: TraceAbstraction took 2019.40 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 96.1 MB in the beginning and 116.7 MB in the end (delta: -20.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:55,484 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.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.09 ms. Allocated memory is still 140.0 MB. Free memory was 107.7 MB in the beginning and 105.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.90 ms. Allocated memory is still 140.0 MB. Free memory was 105.7 MB in the beginning and 104.8 MB in the end (delta: 933.6 kB). Peak memory consumption was 933.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 227.61 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 96.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2019.40 ms. Allocated memory was 140.0 MB in the beginning and 176.7 MB in the end (delta: 36.7 MB). Free memory was 96.1 MB in the beginning and 116.7 MB in the end (delta: -20.5 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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: 12]: Loop Invariant Derived loop invariant: (((4 < j && j < 6) && i <= 999) && a[5] <= 1000) || i <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 1.9s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 22 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=3, 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 19 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 45 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 26 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 241 SizeOfPredicates, 2 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 4/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...