java -ea -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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:31:17,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:31:17,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:31:17,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:31:17,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:31:17,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:31:17,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:31:17,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:31:17,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:31:17,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:31:17,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:31:17,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:31:17,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:31:17,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:31:17,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:31:17,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:31:17,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:31:17,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:31:17,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:31:17,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:31:17,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:31:17,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:31:17,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:31:17,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:31:17,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:31:17,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:31:17,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:31:17,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:31:17,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:31:17,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:31:17,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:31:17,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:31:17,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:31:17,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:31:17,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:31:17,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:31:17,689 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:31:17,703 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:31:17,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:31:17,704 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:31:17,705 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:31:17,705 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:31:17,705 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:31:17,705 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:31:17,706 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:31:17,706 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:31:17,706 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:31:17,706 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:31:17,706 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:31:17,707 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:31:17,707 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:31:17,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:31:17,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:31:17,708 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:31:17,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:31:17,708 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:31:17,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:31:17,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:31:17,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:31:17,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:31:17,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:31:17,710 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:31:17,710 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:31:17,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:31:17,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:31:17,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:31:17,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:31:17,711 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:31:17,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:17,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:31:17,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:31:17,712 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:31:17,712 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:31:17,712 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:31:17,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:31:17,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:31:17,713 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:31:17,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:31:17,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:31:17,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:31:17,761 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:31:17,762 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:31:17,762 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl [2019-01-31 14:31:17,763 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl' [2019-01-31 14:31:17,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:31:17,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:31:17,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:17,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:31:17,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:31:17,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,839 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 14:31:17,839 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 14:31:17,839 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 14:31:17,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:31:17,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:31:17,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:31:17,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:31:17,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/1) ... [2019-01-31 14:31:17,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:31:17,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:31:17,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:31:17,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:31:17,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31: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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:31:17,944 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 14:31:17,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 14:31:17,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 14:31:18,220 INFO L278 CfgBuilder]: Using library mode [2019-01-31 14:31:18,221 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 14:31:18,222 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:18 BoogieIcfgContainer [2019-01-31 14:31:18,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:31:18,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:31:18,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:31:18,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:31:18,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:31:17" (1/2) ... [2019-01-31 14:31:18,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2884a66e and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:31:18, skipping insertion in model container [2019-01-31 14:31:18,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:31:18" (2/2) ... [2019-01-31 14:31:18,230 INFO L112 eAbstractionObserver]: Analyzing ICFG CountTillBound-Jupiter.bpl [2019-01-31 14:31:18,241 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:31:18,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:31:18,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:31:18,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:31:18,361 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:31:18,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:31:18,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:31:18,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:31:18,362 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:31:18,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:31:18,369 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:31:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 14:31:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:31:18,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:18,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:31:18,420 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-01-31 14:31:18,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:18,610 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} x := 0;y := 42; {12#(<= main_x 0)} is VALID [2019-01-31 14:31:18,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(<= main_x 0)} assume !(x < 100); {11#false} is VALID [2019-01-31 14:31:18,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} assume !(x == 100 && y == 42); {11#false} is VALID [2019-01-31 14:31:18,622 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-31 14:31:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:18,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:31:18,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:18,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:18,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:18,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:31:18,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:18,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:31:18,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:31:18,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:18,679 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 14:31:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,798 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-31 14:31:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:18,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:31:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-31 14:31:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-31 14:31:18,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2019-01-31 14:31:18,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:18,895 INFO L225 Difference]: With dead ends: 12 [2019-01-31 14:31:18,895 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 14:31:18,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 14:31:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 14:31:18,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:18,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,973 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,973 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,976 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-31 14:31:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 14:31:18,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:18,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:18,977 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,977 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 14:31:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:18,979 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-31 14:31:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 14:31:18,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:18,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:18,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:18,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-31 14:31:18,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-01-31 14:31:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:18,984 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-31 14:31:18,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 14:31:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:18,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:18,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:31:18,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-01-31 14:31:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:18,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:19,331 INFO L273 TraceCheckUtils]: 0: Hoare triple {51#true} x := 0;y := 42; {53#(<= main_x 0)} is VALID [2019-01-31 14:31:19,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#(<= main_x 0)} assume x < 100;x := x + 1; {54#(<= main_x 1)} is VALID [2019-01-31 14:31:19,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#(<= main_x 1)} assume !(y <= 0); {54#(<= main_x 1)} is VALID [2019-01-31 14:31:19,356 INFO L273 TraceCheckUtils]: 3: Hoare triple {54#(<= main_x 1)} assume !(x < 100); {52#false} is VALID [2019-01-31 14:31:19,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {52#false} assume !(x == 100 && y == 42); {52#false} is VALID [2019-01-31 14:31:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:19,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:19,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:19,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 14:31:19,361 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [13] [2019-01-31 14:31:19,425 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:19,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:19,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:19,669 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 5 times. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 5. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 14:31:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:19,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:19,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:19,677 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-31 14:31:19,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:19,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:19,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:20,056 INFO L273 TraceCheckUtils]: 0: Hoare triple {51#true} x := 0;y := 42; {58#(= main_y 42)} is VALID [2019-01-31 14:31:20,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(= main_y 42)} assume x < 100;x := x + 1; {62#(and (= main_y 42) (<= main_x 100))} is VALID [2019-01-31 14:31:20,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#(and (= main_y 42) (<= main_x 100))} assume !(y <= 0); {62#(and (= main_y 42) (<= main_x 100))} is VALID [2019-01-31 14:31:20,075 INFO L273 TraceCheckUtils]: 3: Hoare triple {62#(and (= main_y 42) (<= main_x 100))} assume !(x < 100); {69#(and (= main_y 42) (<= main_x 100) (<= 100 main_x))} is VALID [2019-01-31 14:31:20,080 INFO L273 TraceCheckUtils]: 4: Hoare triple {69#(and (= main_y 42) (<= main_x 100) (<= 100 main_x))} assume !(x == 100 && y == 42); {52#false} is VALID [2019-01-31 14:31:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:20,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:20,272 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-31 14:31:20,324 INFO L273 TraceCheckUtils]: 4: Hoare triple {69#(and (= main_y 42) (<= main_x 100) (<= 100 main_x))} assume !(x == 100 && y == 42); {52#false} is VALID [2019-01-31 14:31:20,325 INFO L273 TraceCheckUtils]: 3: Hoare triple {76#(or (and (= main_y 42) (<= main_x 100)) (< main_x 100))} assume !(x < 100); {69#(and (= main_y 42) (<= main_x 100) (<= 100 main_x))} is VALID [2019-01-31 14:31:20,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {76#(or (and (= main_y 42) (<= main_x 100)) (< main_x 100))} assume !(y <= 0); {76#(or (and (= main_y 42) (<= main_x 100)) (< main_x 100))} is VALID [2019-01-31 14:31:20,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(= main_y 42)} assume x < 100;x := x + 1; {76#(or (and (= main_y 42) (<= main_x 100)) (< main_x 100))} is VALID [2019-01-31 14:31:20,337 INFO L273 TraceCheckUtils]: 0: Hoare triple {51#true} x := 0;y := 42; {58#(= main_y 42)} is VALID [2019-01-31 14:31:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:20,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 14:31:20,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2019-01-31 14:31:20,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:20,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 14:31:20,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:20,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 14:31:20,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:20,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 14:31:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 14:31:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:31:20,371 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 5 states. [2019-01-31 14:31:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:20,455 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 14:31:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:20,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 14:31:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-31 14:31:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-31 14:31:20,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 11 transitions. [2019-01-31 14:31:20,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:20,555 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:20,555 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:20,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:31:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:20,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:20,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:20,557 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:20,557 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:20,557 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:20,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:20,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:20,558 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:20,558 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:20,558 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:20,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:20,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:20,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:20,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:20,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-31 14:31:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:20,560 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:20,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 14:31:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:20,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:20,601 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 14 28) no Hoare annotation was computed. [2019-01-31 14:31:20,602 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-31 14:31:20,602 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 28) no Hoare annotation was computed. [2019-01-31 14:31:20,602 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (and (= main_y 42) (<= main_x 100)) [2019-01-31 14:31:20,602 INFO L444 ceAbstractionStarter]: At program point L19-1(lines 19 25) the Hoare annotation is: (and (= main_y 42) (<= main_x 100)) [2019-01-31 14:31:20,602 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 27) no Hoare annotation was computed. [2019-01-31 14:31:20,603 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 28) no Hoare annotation was computed. [2019-01-31 14:31:20,604 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-31 14:31:20,609 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2019-01-31 14:31:20,610 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2019-01-31 14:31:20,610 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2019-01-31 14:31:20,610 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-31 14:31:20,610 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:20,616 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:20 BoogieIcfgContainer [2019-01-31 14:31:20,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:20,617 INFO L168 Benchmark]: Toolchain (without parser) took 2816.81 ms. Allocated memory was 133.2 MB in the beginning and 170.4 MB in the end (delta: 37.2 MB). Free memory was 107.2 MB in the beginning and 99.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:20,619 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.35 ms. Allocated memory is still 133.2 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:20,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 133.2 MB. Free memory was 107.2 MB in the beginning and 105.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:20,620 INFO L168 Benchmark]: Boogie Preprocessor took 28.27 ms. Allocated memory is still 133.2 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:20,621 INFO L168 Benchmark]: RCFGBuilder took 351.15 ms. Allocated memory is still 133.2 MB. Free memory was 104.1 MB in the beginning and 94.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:20,622 INFO L168 Benchmark]: TraceAbstraction took 2392.39 ms. Allocated memory was 133.2 MB in the beginning and 170.4 MB in the end (delta: 37.2 MB). Free memory was 94.0 MB in the beginning and 99.3 MB in the end (delta: -5.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:20,627 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.35 ms. Allocated memory is still 133.2 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 133.2 MB. Free memory was 107.2 MB in the beginning and 105.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.27 ms. Allocated memory is still 133.2 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 351.15 ms. Allocated memory is still 133.2 MB. Free memory was 104.1 MB in the beginning and 94.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2392.39 ms. Allocated memory was 133.2 MB in the beginning and 170.4 MB in the end (delta: 37.2 MB). Free memory was 94.0 MB in the beginning and 99.3 MB in the end (delta: -5.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 19]: Loop Invariant Derived loop invariant: y == 42 && x <= 100 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: y == 42 && x <= 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 11 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 14 HoareAnnotationTreeSize, 2 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 1 NumberOfNonLiveVariables, 12 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...