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/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 12:56:51,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:56:51,903 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:56:51,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:56:51,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:56:51,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:56:51,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:56:51,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:56:51,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:56:51,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:56:51,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:56:51,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:56:51,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:56:51,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:56:51,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:56:51,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:56:51,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:56:51,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:56:51,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:56:51,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:56:51,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:56:51,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:56:51,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:56:51,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:56:51,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:56:51,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:56:51,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:56:51,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:56:51,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:56:51,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:56:51,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:56:51,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:56:51,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:56:51,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:56:51,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:56:51,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:56:51,946 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-02-27 12:56:51,958 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:56:51,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:56:51,959 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:56:51,960 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:56:51,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:56:51,960 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:56:51,960 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:56:51,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:56:51,961 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:56:51,961 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:56:51,961 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:56:51,961 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:56:51,961 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:56:51,961 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:56:51,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:56:51,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:56:51,962 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:56:51,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:56:51,963 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:56:51,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:56:51,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:56:51,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:56:51,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:56:51,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:56:51,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:56:51,964 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:56:51,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:56:51,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:56:51,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:56:51,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:56:51,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:56:51,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:56:51,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:56:51,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:56:51,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:56:51,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:56:51,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:56:51,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:56:51,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:56:51,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:56:51,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:56:52,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:56:52,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:56:52,016 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:56:52,016 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:56:52,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl [2019-02-27 12:56:52,017 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl' [2019-02-27 12:56:52,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:56:52,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:56:52,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:56:52,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:56:52,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:56:52,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,083 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-27 12:56:52,083 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-27 12:56:52,083 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-27 12:56:52,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:56:52,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:56:52,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:56:52,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:56:52,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/1) ... [2019-02-27 12:56:52,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:56:52,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:56:52,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:56:52,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:56:52,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (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-02-27 12:56:52,175 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-27 12:56:52,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-27 12:56:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-27 12:56:52,578 INFO L278 CfgBuilder]: Using library mode [2019-02-27 12:56:52,578 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-27 12:56:52,579 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:56:52 BoogieIcfgContainer [2019-02-27 12:56:52,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:56:52,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:56:52,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:56:52,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:56:52,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:56:52" (1/2) ... [2019-02-27 12:56:52,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f870b4e and model type GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:56:52, skipping insertion in model container [2019-02-27 12:56:52,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:56:52" (2/2) ... [2019-02-27 12:56:52,596 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalIntegerCakeWithArray.bpl [2019-02-27 12:56:52,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:56:52,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-27 12:56:52,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-27 12:56:52,721 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:56:52,722 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:56:52,722 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:56:52,722 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:56:52,722 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:56:52,723 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:56:52,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:56:52,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:56:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-27 12:56:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-27 12:56:52,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:56:52,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-27 12:56:52,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:56:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:56:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-02-27 12:56:52,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:56:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:56:52,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:56:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:56:52,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:56:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:56:53,258 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-02-27 12:56:53,295 INFO L273 TraceCheckUtils]: 0: Hoare triple {11#true} assume init >= 0;m := m[cakeLeft := init];m := m[eat := init / 2]; {13#(and (= (div main_init 2) (select main_m main_eat)) (or (<= 0 (div main_init 2)) (not (= main_init (select main_m main_cakeLeft)))) (or (= main_eat main_cakeLeft) (= main_init (select main_m main_cakeLeft))))} is VALID [2019-02-27 12:56:53,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and (= (div main_init 2) (select main_m main_eat)) (or (<= 0 (div main_init 2)) (not (= main_init (select main_m main_cakeLeft)))) (or (= main_eat main_cakeLeft) (= main_init (select main_m main_cakeLeft))))} assume !(cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0)); {12#false} is VALID [2019-02-27 12:56:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:56:53,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:56:53,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-27 12:56:53,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:56:53,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:56:53,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:56:53,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:56:53,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:56:53,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:56:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:56:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:56:53,357 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-27 12:56:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:53,727 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-02-27 12:56:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:56:53,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:56:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:56:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:56:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-27 12:56:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:56:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-27 12:56:53,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-27 12:56:53,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:56:53,842 INFO L225 Difference]: With dead ends: 15 [2019-02-27 12:56:53,842 INFO L226 Difference]: Without dead ends: 8 [2019-02-27 12:56:53,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:56:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-27 12:56:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-27 12:56:53,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:56:53,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-27 12:56:53,979 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-27 12:56:53,980 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-27 12:56:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:53,986 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-27 12:56:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-27 12:56:53,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:53,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:56:53,987 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-27 12:56:53,987 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-27 12:56:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:53,993 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-27 12:56:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-27 12:56:53,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:53,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:56:53,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:56:53,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:56:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-27 12:56:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-27 12:56:54,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-02-27 12:56:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:56:54,005 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-27 12:56:54,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:56:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-27 12:56:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:56:54,006 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:56:54,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:56:54,007 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:56:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:56:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash 926592, now seen corresponding path program 1 times [2019-02-27 12:56:54,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:56:54,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:56:54,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:56:54,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:56:54,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:56:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:56:54,579 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-02-27 12:56:54,766 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} assume init >= 0;m := m[cakeLeft := init];m := m[eat := init / 2]; {61#(and (or (= main_eat main_cakeLeft) (= main_init (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft))) (= (div main_init 2) (select main_m main_eat)))} is VALID [2019-02-27 12:56:54,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#(and (or (= main_eat main_cakeLeft) (= main_init (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft))) (= (div main_init 2) (select main_m main_eat)))} assume cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0); {62#(or (= main_cakeLeft main_eat) (and (= (div main_init 2) (select main_m main_eat)) (<= 0 (select main_m main_eat)) (= main_init (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft))))} is VALID [2019-02-27 12:56:54,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#(or (= main_cakeLeft main_eat) (and (= (div main_init 2) (select main_m main_eat)) (<= 0 (select main_m main_eat)) (= main_init (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft))))} m := m[eat := m[eat] / 2];m := m[cakeLeft := m[cakeLeft] - m[eat]]; {63#(or (and (<= 0 (select main_m main_eat)) (<= (+ (div main_init 2) (select main_m main_eat)) (select main_m main_cakeLeft))) (= main_cakeLeft main_eat))} is VALID [2019-02-27 12:56:54,791 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(or (and (<= 0 (select main_m main_eat)) (<= (+ (div main_init 2) (select main_m main_eat)) (select main_m main_cakeLeft))) (= main_cakeLeft main_eat))} assume !(cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0)); {60#false} is VALID [2019-02-27 12:56:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:56:54,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:56:54,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:56:54,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-27 12:56:54,795 INFO L207 CegarAbsIntRunner]: [0], [2], [3], [6] [2019-02-27 12:56:54,830 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:56:54,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:56:54,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:56:54,928 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 5. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 12:56:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:56:54,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:56:54,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:56:54,934 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-02-27 12:56:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:56:54,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:56:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:56:54,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-27 12:56:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:56:54,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:56:55,197 WARN L277 Elim1Store]: Array PQE input equivalent to false [2019-02-27 12:56:55,214 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,366 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2019-02-27 12:56:55,381 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 9 [2019-02-27 12:56:55,386 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,395 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,435 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,547 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2019-02-27 12:56:55,579 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-02-27 12:56:55,590 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,606 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:56:55,683 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-02-27 12:56:55,696 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 9 [2019-02-27 12:56:55,701 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,711 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:56:55,753 INFO L301 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-27 12:56:55,796 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-27 12:56:55,797 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:82, output treesize:38 [2019-02-27 12:56:58,025 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:56:58,026 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_main_m_11, v_prenex_1]. (or (let ((.cse2 (select v_main_m_11 main_eat))) (and (= (let ((.cse1 (div .cse2 2))) (let ((.cse0 (store v_main_m_11 main_eat .cse1))) (store .cse0 main_cakeLeft (+ (select .cse0 main_cakeLeft) (* (- 1) .cse1))))) main_m) (<= 0 .cse2) (<= (+ (div main_init 2) .cse2) (select v_main_m_11 main_cakeLeft)))) (and (= main_cakeLeft main_eat) (= (let ((.cse4 (div (select v_prenex_1 main_eat) 2))) (let ((.cse3 (store v_prenex_1 main_eat .cse4))) (store .cse3 main_cakeLeft (+ (select .cse3 main_cakeLeft) (* (- 1) .cse4))))) main_m))) [2019-02-27 12:56:58,026 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_2]. (let ((.cse1 (select main_m main_eat))) (or (let ((.cse0 (div v_arrayElimCell_2 2))) (and (= .cse0 .cse1) (not (= main_eat main_cakeLeft)) (<= 0 v_arrayElimCell_2) (<= (+ (div main_init 2) v_arrayElimCell_2) (+ .cse0 (select main_m main_cakeLeft))))) (and (= main_cakeLeft main_eat) (= 0 .cse1)))) [2019-02-27 12:56:58,240 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-27 12:56:58,244 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} assume init >= 0;m := m[cakeLeft := init];m := m[eat := init / 2]; {59#true} is VALID [2019-02-27 12:56:58,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} assume cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0); {63#(or (and (<= 0 (select main_m main_eat)) (<= (+ (div main_init 2) (select main_m main_eat)) (select main_m main_cakeLeft))) (= main_cakeLeft main_eat))} is VALID [2019-02-27 12:56:58,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(or (and (<= 0 (select main_m main_eat)) (<= (+ (div main_init 2) (select main_m main_eat)) (select main_m main_cakeLeft))) (= main_cakeLeft main_eat))} m := m[eat := m[eat] / 2];m := m[cakeLeft := m[cakeLeft] - m[eat]]; {73#(or (and (not (= main_eat main_cakeLeft)) (exists ((v_arrayElimCell_2 Int)) (and (= (div v_arrayElimCell_2 2) (select main_m main_eat)) (<= 0 v_arrayElimCell_2) (<= (+ (div main_init 2) v_arrayElimCell_2) (+ (div v_arrayElimCell_2 2) (select main_m main_cakeLeft)))))) (and (= main_cakeLeft main_eat) (= 0 (select main_m main_eat))))} is VALID [2019-02-27 12:56:58,252 INFO L273 TraceCheckUtils]: 3: Hoare triple {73#(or (and (not (= main_eat main_cakeLeft)) (exists ((v_arrayElimCell_2 Int)) (and (= (div v_arrayElimCell_2 2) (select main_m main_eat)) (<= 0 v_arrayElimCell_2) (<= (+ (div main_init 2) v_arrayElimCell_2) (+ (div v_arrayElimCell_2 2) (select main_m main_cakeLeft)))))) (and (= main_cakeLeft main_eat) (= 0 (select main_m main_eat))))} assume !(cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0)); {60#false} is VALID [2019-02-27 12:56:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:56:58,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:56:58,364 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(or (and (<= 0 (select main_m main_eat)) (<= (+ (div main_init 2) (select main_m main_eat)) (select main_m main_cakeLeft))) (= main_cakeLeft main_eat))} assume !(cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0)); {60#false} is VALID [2019-02-27 12:56:58,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {80#(or (and (<= 0 (select (store (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft (+ (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft) (* (- 1) (div (select main_m main_eat) 2)))) main_eat)) (<= (+ (div main_init 2) (select (store (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft (+ (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft) (* (- 1) (div (select main_m main_eat) 2)))) main_eat) (div (select main_m main_eat) 2)) (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft))) (= main_cakeLeft main_eat))} m := m[eat := m[eat] / 2];m := m[cakeLeft := m[cakeLeft] - m[eat]]; {63#(or (and (<= 0 (select main_m main_eat)) (<= (+ (div main_init 2) (select main_m main_eat)) (select main_m main_cakeLeft))) (= main_cakeLeft main_eat))} is VALID [2019-02-27 12:56:58,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} assume cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0); {80#(or (and (<= 0 (select (store (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft (+ (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft) (* (- 1) (div (select main_m main_eat) 2)))) main_eat)) (<= (+ (div main_init 2) (select (store (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft (+ (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft) (* (- 1) (div (select main_m main_eat) 2)))) main_eat) (div (select main_m main_eat) 2)) (select (store main_m main_eat (div (select main_m main_eat) 2)) main_cakeLeft))) (= main_cakeLeft main_eat))} is VALID [2019-02-27 12:56:58,380 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} assume init >= 0;m := m[cakeLeft := init];m := m[eat := init / 2]; {59#true} is VALID [2019-02-27 12:56:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:56:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-27 12:56:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-02-27 12:56:58,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:56:58,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:56:58,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:56:58,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:56:58,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:56:58,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:56:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:56:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:56:58,412 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-02-27 12:56:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:58,514 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-27 12:56:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:56:58,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:56:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:56:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:56:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-27 12:56:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:56:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-27 12:56:58,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-02-27 12:56:58,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:56:58,540 INFO L225 Difference]: With dead ends: 8 [2019-02-27 12:56:58,540 INFO L226 Difference]: Without dead ends: 7 [2019-02-27 12:56:58,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-02-27 12:56:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-27 12:56:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-27 12:56:58,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:56:58,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-27 12:56:58,573 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-27 12:56:58,573 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-27 12:56:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:58,574 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-27 12:56:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-27 12:56:58,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:58,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:56:58,575 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-27 12:56:58,575 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-27 12:56:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:58,576 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-27 12:56:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-27 12:56:58,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:58,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:56:58,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:56:58,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:56:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-27 12:56:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-27 12:56:58,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-27 12:56:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:56:58,578 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-27 12:56:58,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:56:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-27 12:56:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-27 12:56:58,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:56:58,579 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-27 12:56:58,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:56:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:56:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash 890456194, now seen corresponding path program 1 times [2019-02-27 12:56:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:56:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:56:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:56:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:56:58,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:56:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:56:58,661 INFO L273 TraceCheckUtils]: 0: Hoare triple {119#true} assume init >= 0;m := m[cakeLeft := init];m := m[eat := init / 2]; {119#true} is VALID [2019-02-27 12:56:58,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#true} assume cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0); {119#true} is VALID [2019-02-27 12:56:58,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {119#true} m := m[eat := m[eat] / 2];m := m[cakeLeft := m[cakeLeft] - m[eat]]; {119#true} is VALID [2019-02-27 12:56:58,664 INFO L273 TraceCheckUtils]: 3: Hoare triple {119#true} assume cakeLeft == eat || (m[eat] + init / 2 <= m[cakeLeft] && m[eat] >= 0); {121#(or (<= (div main_init 2) (select main_m main_cakeLeft)) (= main_cakeLeft main_eat))} is VALID [2019-02-27 12:56:58,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {121#(or (<= (div main_init 2) (select main_m main_cakeLeft)) (= main_cakeLeft main_eat))} assume cakeLeft != eat; {122#(<= (div main_init 2) (select main_m main_cakeLeft))} is VALID [2019-02-27 12:56:58,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {122#(<= (div main_init 2) (select main_m main_cakeLeft))} assume !(m[cakeLeft] >= init / 2); {120#false} is VALID [2019-02-27 12:56:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-27 12:56:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:56:58,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-27 12:56:58,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:56:58,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-27 12:56:58,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:56:58,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:56:58,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:56:58,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:56:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:56:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:56:58,691 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-02-27 12:56:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:58,787 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-27 12:56:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:56:58,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-27 12:56:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:56:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:56:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-02-27 12:56:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:56:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-02-27 12:56:58,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 7 transitions. [2019-02-27 12:56:58,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:56:58,811 INFO L225 Difference]: With dead ends: 7 [2019-02-27 12:56:58,811 INFO L226 Difference]: Without dead ends: 0 [2019-02-27 12:56:58,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-27 12:56:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-27 12:56:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-27 12:56:58,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:56:58,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-27 12:56:58,814 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:56:58,814 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:56:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:58,814 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:56:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:56:58,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:58,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:56:58,815 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:56:58,815 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:56:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:56:58,815 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:56:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:56:58,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:58,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:56:58,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:56:58,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:56:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-27 12:56:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-27 12:56:58,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-27 12:56:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:56:58,817 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-27 12:56:58,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:56:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:56:58,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:56:58,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-27 12:56:58,944 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 8 28) no Hoare annotation was computed. [2019-02-27 12:56:58,944 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-02-27 12:56:58,944 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 28) no Hoare annotation was computed. [2019-02-27 12:56:58,944 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 8 28) no Hoare annotation was computed. [2019-02-27 12:56:58,945 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2019-02-27 12:56:58,945 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINVARIANTandASSERT(line 19) no Hoare annotation was computed. [2019-02-27 12:56:58,945 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 26) no Hoare annotation was computed. [2019-02-27 12:56:58,945 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 23) the Hoare annotation is: (let ((.cse2 (select main_m main_eat)) (.cse0 (= main_eat main_cakeLeft))) (or (and (not .cse0) (exists ((v_arrayElimCell_2 Int)) (let ((.cse1 (div v_arrayElimCell_2 2))) (and (= .cse1 (select main_m main_eat)) (<= 0 v_arrayElimCell_2) (<= (+ (div main_init 2) v_arrayElimCell_2) (+ .cse1 (select main_m main_cakeLeft))))))) (and (= main_cakeLeft main_eat) (= 0 .cse2)) (and (= (div main_init 2) .cse2) (not (= main_init (select main_m main_cakeLeft))) .cse0))) [2019-02-27 12:56:58,947 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-02-27 12:56:58,947 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONINVARIANTandASSERT has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2019-02-27 12:56:58,948 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2019-02-27 12:56:58,948 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-27 12:56:58,957 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 12:56:58 BoogieIcfgContainer [2019-02-27 12:56:58,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 12:56:58,958 INFO L168 Benchmark]: Toolchain (without parser) took 6908.40 ms. Allocated memory was 137.9 MB in the beginning and 211.3 MB in the end (delta: 73.4 MB). Free memory was 104.2 MB in the beginning and 136.4 MB in the end (delta: -32.1 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:56:58,959 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory is still 105.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:56:58,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.90 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 102.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-27 12:56:58,961 INFO L168 Benchmark]: Boogie Preprocessor took 23.26 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 101.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:56:58,961 INFO L168 Benchmark]: RCFGBuilder took 470.13 ms. Allocated memory is still 137.9 MB. Free memory was 101.0 MB in the beginning and 89.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-02-27 12:56:58,962 INFO L168 Benchmark]: TraceAbstraction took 6376.04 ms. Allocated memory was 137.9 MB in the beginning and 211.3 MB in the end (delta: 73.4 MB). Free memory was 89.2 MB in the beginning and 136.4 MB in the end (delta: -47.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:56:58,966 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.17 ms. Allocated memory is still 137.9 MB. Free memory is still 105.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.90 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 102.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.26 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 101.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 470.13 ms. Allocated memory is still 137.9 MB. Free memory was 101.0 MB in the beginning and 89.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6376.04 ms. Allocated memory was 137.9 MB in the beginning and 211.3 MB in the end (delta: 73.4 MB). Free memory was 89.2 MB in the beginning and 136.4 MB in the end (delta: -47.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((!(eat == cakeLeft) && (exists v_arrayElimCell_2 : int :: (v_arrayElimCell_2 / 2 == m[eat] && 0 <= v_arrayElimCell_2) && init / 2 + v_arrayElimCell_2 <= v_arrayElimCell_2 / 2 + m[cakeLeft])) || (cakeLeft == eat && 0 == m[eat])) || ((init / 2 == m[eat] && !(init == m[cakeLeft])) && eat == cakeLeft) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. SAFE Result, 6.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 10 SDslu, 1 SDs, 0 SdLazy, 25 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 57 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 1 QuantifiedInterpolants, 869 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 4/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...