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-a9d37a5-m [2019-02-28 13:07:24,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:07:24,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:07:24,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:07:24,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:07:24,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:07:24,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:07:24,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:07:24,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:07:24,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:07:24,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:07:24,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:07:24,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:07:24,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:07:24,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:07:24,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:07:24,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:07:24,924 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:07:24,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:07:24,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:07:24,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:07:24,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:07:24,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:07:24,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:07:24,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:07:24,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:07:24,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:07:24,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:07:24,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:07:24,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:07:24,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:07:24,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:07:24,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:07:24,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:07:24,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:07:24,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:07:24,944 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-28 13:07:24,956 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:07:24,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:07:24,957 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:07:24,957 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:07:24,957 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:07:24,958 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:07:24,958 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:07:24,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:07:24,958 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:07:24,958 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:07:24,959 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:07:24,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:07:24,959 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:07:24,959 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:07:24,960 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:07:24,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:07:24,960 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:07:24,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:07:24,961 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:07:24,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:07:24,961 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:07:24,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:07:24,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:07:24,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:07:24,962 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:07:24,962 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:07:24,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:07:24,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:07:24,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:07:24,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:07:24,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:07:24,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:07:24,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:07:24,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:07:24,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:07:24,964 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:07:24,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:07:24,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:07:24,965 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:07:24,965 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:07:25,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:07:25,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:07:25,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:07:25,024 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:07:25,025 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:07:25,026 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-28 13:07:25,026 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl' [2019-02-28 13:07:25,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:07:25,073 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:07:25,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:07:25,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:07:25,074 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:07:25,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,109 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:07:25,109 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:07:25,110 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:07:25,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:07:25,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:07:25,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:07:25,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:07:25,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/1) ... [2019-02-28 13:07:25,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:07:25,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:07:25,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:07:25,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:07:25,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:07:25,214 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 13:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 13:07:25,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 13:07:25,632 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:07:25,633 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 13:07:25,634 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:07:25 BoogieIcfgContainer [2019-02-28 13:07:25,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:07:25,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:07:25,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:07:25,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:07:25,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:07:25" (1/2) ... [2019-02-28 13:07:25,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468ac040 and model type GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:07:25, skipping insertion in model container [2019-02-28 13:07:25,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:07:25" (2/2) ... [2019-02-28 13:07:25,642 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalIntegerCakeWithArray.bpl [2019-02-28 13:07:25,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:07:25,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 13:07:25,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 13:07:25,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:07:25,708 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:07:25,708 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:07:25,708 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:07:25,708 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:07:25,708 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:07:25,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:07:25,709 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:07:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-28 13:07:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:07:25,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:07:25,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:07:25,733 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-02-28 13:07:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:07:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-02-28 13:07:25,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:07:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:07:25,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:07:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:07:25,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:07:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:07:26,272 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-02-28 13:07:26,293 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-28 13:07:26,298 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-28 13:07:26,300 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-28 13:07:26,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:07:26,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:07:26,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:07:26,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:07:26,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:07:26,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:07:26,339 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-28 13:07:26,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:07:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:07:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:07:26,349 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-28 13:07:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:07:26,671 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-02-28 13:07:26,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:07:26,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:07:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:07:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:07:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-28 13:07:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:07:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-28 13:07:26,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-28 13:07:26,823 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-28 13:07:26,832 INFO L225 Difference]: With dead ends: 15 [2019-02-28 13:07:26,833 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 13:07:26,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:07:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 13:07:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 13:07:26,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:07:26,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-28 13:07:26,873 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:07:26,873 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:07:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:07:26,875 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:07:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:07:26,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:07:26,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:07:26,876 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:07:26,877 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:07:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:07:26,878 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:07:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:07:26,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:07:26,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:07:26,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:07:26,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:07:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:07:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 13:07:26,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-02-28 13:07:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:07:26,883 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 13:07:26,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:07:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:07:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:07:26,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:07:26,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:07:26,884 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-02-28 13:07:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:07:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash 926592, now seen corresponding path program 1 times [2019-02-28 13:07:26,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:07:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:07:26,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:07:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:07:26,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:07:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:07:27,309 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-02-28 13:07:27,579 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-28 13:07:27,581 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-28 13:07:27,599 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-28 13:07:27,614 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-28 13:07:27,615 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-28 13:07:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:07:27,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:07:27,617 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:07:27,618 INFO L207 CegarAbsIntRunner]: [0], [2], [3], [6] [2019-02-28 13:07:27,654 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:07:27,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:07:27,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:07:27,769 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-28 13:07:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:07:27,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:07:27,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:07:27,775 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-28 13:07:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:07:27,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:07:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:07:27,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 13:07:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:07:27,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:07:28,174 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 13:07:28,286 INFO L442 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-28 13:07:28,368 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-28 13:07:28,385 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:07:28,408 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:07:28,419 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:07:28,537 INFO L442 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-28 13:07:28,557 INFO L442 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 26 [2019-02-28 13:07:28,570 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:07:28,597 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:07:28,645 INFO L442 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-28 13:07:28,667 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-28 13:07:28,672 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:07:28,685 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:07:28,752 INFO L315 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-28 13:07:28,779 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-28 13:07:28,780 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:82, output treesize:38