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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-4b9831f [2018-12-23 14:32:40,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:32:40,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:32:40,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:32:40,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:32:40,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:32:40,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:32:40,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:32:40,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:32:40,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:32:40,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:32:40,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:32:40,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:32:40,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:32:40,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:32:40,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:32:40,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:32:40,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:32:40,556 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:32:40,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:32:40,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:32:40,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:32:40,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:32:40,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:32:40,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:32:40,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:32:40,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:32:40,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:32:40,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:32:40,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:32:40,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:32:40,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:32:40,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:32:40,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:32:40,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:32:40,583 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:32:40,583 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-23 14:32:40,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:32:40,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:32:40,597 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:32:40,597 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:32:40,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:32:40,598 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:32:40,598 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:32:40,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:32:40,598 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:32:40,598 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-23 14:32:40,599 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-23 14:32:40,599 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:32:40,599 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:32:40,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:32:40,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:32:40,600 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:32:40,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:32:40,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:32:40,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:32:40,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:32:40,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:32:40,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:32:40,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:32:40,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:32:40,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:32:40,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:32:40,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:32:40,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:32:40,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:32:40,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:32:40,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:32:40,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:32:40,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:32:40,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:32:40,604 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:32:40,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:32:40,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:32:40,604 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:32:40,605 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:32:40,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:32:40,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:32:40,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:32:40,656 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:32:40,657 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:32:40,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-12-23 14:32:40,659 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-12-23 14:32:40,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:32:40,719 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:32:40,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:32:40,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:32:40,720 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:32:40,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,767 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-23 14:32:40,767 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-23 14:32:40,768 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-23 14:32:40,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:32:40,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:32:40,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:32:40,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:32:40,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... [2018-12-23 14:32:40,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:32:40,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:32:40,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:32:40,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:32:40,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:32:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-23 14:32:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-23 14:32:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-23 14:32:41,326 INFO L272 CfgBuilder]: Using library mode [2018-12-23 14:32:41,327 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-23 14:32:41,327 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:32:41 BoogieIcfgContainer [2018-12-23 14:32:41,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:32:41,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:32:41,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:32:41,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:32:41,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:40" (1/2) ... [2018-12-23 14:32:41,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7462b188 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:32:41, skipping insertion in model container [2018-12-23 14:32:41,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:32:41" (2/2) ... [2018-12-23 14:32:41,336 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-12-23 14:32:41,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:32:41,362 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-23 14:32:41,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-23 14:32:41,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:32:41,452 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:32:41,452 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:32:41,459 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:32:41,459 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:32:41,459 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:32:41,459 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:32:41,460 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:32:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-23 14:32:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:32:41,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:32:41,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:32:41,485 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:32:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:32:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-23 14:32:41,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:32:41,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:32:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:41,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:32:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:32:41,736 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];p.base, p.offset := ~malloc_#res.base, ~malloc_#res.offset;q.base, q.offset := p.base, p.offset; {12#(<= (+ main_q.offset 400) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:41,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(<= (+ main_q.offset 400) (select |#length| main_q.base))} assume q.offset < p.offset + 400; {12#(<= (+ main_q.offset 400) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:41,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(<= (+ main_q.offset 400) (select |#length| main_q.base))} assume !(4 + q.offset <= #length[q.base]); {11#false} is VALID [2018-12-23 14:32:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:32:41,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:32:41,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-23 14:32:41,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:32:41,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:32:41,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:32:41,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:32:41,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:41,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:32:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:32:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:32:41,788 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-23 14:32:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:41,905 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-23 14:32:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:32:41,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:32:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:32:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:32:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-23 14:32:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:32:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-23 14:32:41,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2018-12-23 14:32:42,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:42,012 INFO L225 Difference]: With dead ends: 15 [2018-12-23 14:32:42,012 INFO L226 Difference]: Without dead ends: 8 [2018-12-23 14:32:42,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:32:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-23 14:32:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-23 14:32:42,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:32:42,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 7 states. [2018-12-23 14:32:42,067 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 7 states. [2018-12-23 14:32:42,067 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 7 states. [2018-12-23 14:32:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:42,070 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-23 14:32:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-23 14:32:42,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:42,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:42,071 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states. [2018-12-23 14:32:42,071 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states. [2018-12-23 14:32:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:42,073 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-23 14:32:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-23 14:32:42,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:42,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:42,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:32:42,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:32:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-23 14:32:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-23 14:32:42,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2018-12-23 14:32:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:32:42,078 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-23 14:32:42,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:32:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-23 14:32:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-23 14:32:42,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:32:42,079 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-23 14:32:42,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:32:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:32:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2018-12-23 14:32:42,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:32:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:42,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:32:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:42,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:32:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:32:42,370 INFO L273 TraceCheckUtils]: 0: Hoare triple {57#true} ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];p.base, p.offset := ~malloc_#res.base, ~malloc_#res.offset;q.base, q.offset := p.base, p.offset; {59#(<= (+ main_q.offset 400) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:42,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#(<= (+ main_q.offset 400) (select |#length| main_q.base))} assume q.offset < p.offset + 400; {59#(<= (+ main_q.offset 400) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:42,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#(<= (+ main_q.offset 400) (select |#length| main_q.base))} assume 4 + q.offset <= #length[q.base]; {59#(<= (+ main_q.offset 400) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:42,377 INFO L273 TraceCheckUtils]: 3: Hoare triple {59#(<= (+ main_q.offset 400) (select |#length| main_q.base))} q.base, q.offset := q.base, q.offset + 4; {60#(<= (+ main_q.offset 396) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:42,378 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#(<= (+ main_q.offset 396) (select |#length| main_q.base))} assume q.offset < p.offset + 400; {60#(<= (+ main_q.offset 396) (select |#length| main_q.base))} is VALID [2018-12-23 14:32:42,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#(<= (+ main_q.offset 396) (select |#length| main_q.base))} assume !(4 + q.offset <= #length[q.base]); {58#false} is VALID [2018-12-23 14:32:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:32:42,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:32:42,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:32:42,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-23 14:32:42,392 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2018-12-23 14:32:42,451 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-23 14:32:42,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:32:45,233 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-23 14:32:45,234 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-23 14:32:45,235 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:32:45,236 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:32:45,236 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_3 Int) (v_idx_4 Int) (v_idx_5 Int) (v_idx_6 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_2_1 Bool) (v_v_1_1 Bool) (v_v_5_1 Bool) (v_v_0_1 Int) (v_v_3_1 Int) (v_v_4_1 Int)) (and (= v_v_0_1 (select |c_main_~malloc_old_#length| v_idx_1)) (= (select |c_#length| v_idx_4) v_v_3_1) (= (select |c_#valid| v_idx_2) v_v_1_1) (= v_v_4_1 (select |c_old(#length)| v_idx_5)) (= v_v_5_1 (select |c_main_~malloc_old_#valid| v_idx_6)) (= (select |c_old(#valid)| v_idx_3) v_v_2_1))))} [2018-12-23 14:32:45,236 WARN L228 ngHoareTripleChecker]: Action: ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];p.base, p.offset := ~malloc_#res.base, ~malloc_#res.offset;q.base, q.offset := p.base, p.offset; [2018-12-23 14:32:45,237 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (select |c_main_~malloc_old_#valid_primed| |c_main_~malloc_#res.base_primed|)) (= c_main_p.offset_primed |c_main_~malloc_#res.offset_primed|) (= (store |c_main_~malloc_old_#length_primed| |c_main_~malloc_#res.base_primed| c_main_~malloc_~size_primed) |c_#length_primed|) (= |c_main_~malloc_old_#valid_primed| |c_#valid|) (= c_main_p.base_primed |c_main_~malloc_#res.base_primed|) (= |c_main_~malloc_old_#length_primed| |c_#length|) (= c_main_~malloc_~size_primed 400) (= c_main_q.offset_primed c_main_p.offset_primed) (= c_main_q.base_primed c_main_p.base_primed) (= (store |c_main_~malloc_old_#valid_primed| |c_main_~malloc_#res.base_primed| true) |c_#valid_primed|) (= 0 |c_main_~malloc_#res.offset_primed|) (not (= |c_main_~malloc_#res.base_primed| 0))) [2018-12-23 14:32:45,238 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_7 Int) (v_idx_14 Int) (v_idx_8 Int) (v_idx_15 Int) (v_idx_9 Int) (v_idx_12 Int) (v_idx_13 Int) (v_idx_10 Int) (v_idx_11 Int) (v_idx_16 Int)) (exists ((v_v_2_1 Bool) (v_b_4_1 Int) (v_v_22_1 Int) (v_b_5_1 Int) (v_v_20_1 Int) (v_v_21_1 Int) (v_b_8_1 Int) (v_b_9_1 Int) (v_v_8_1 Bool) (v_v_16_1 Bool) (v_v_15_1 Bool) (v_v_14_1 Bool) (v_v_3_1 Int) (v_v_4_1 Int)) (and (<= (- c_main_q.offset (- |c_main_~malloc_#res.offset|)) 0) (or (< v_idx_10 v_b_4_1) (= (select |c_#valid| v_idx_10) v_v_15_1) (<= v_b_5_1 v_idx_10)) (<= (- (- v_b_8_1) (- |c_main_~malloc_#res.base|)) 0) (<= (- (- |c_main_~malloc_#res.offset|) c_main_~malloc_~size) (- 400)) (<= (- |c_main_~malloc_#res.offset| (- c_main_~malloc_~size)) 400) (<= (- (- c_main_p.offset) (- v_v_21_1)) 400) (<= (- c_main_~malloc_~size v_v_21_1) 0) (<= (- c_main_p.offset (- v_v_21_1)) 400) (<= (- (- v_b_4_1) (- |c_main_~malloc_#res.base|)) 0) (<= (- (- c_main_~malloc_~size) v_v_21_1) (- 800)) v_v_15_1 (<= (- (- c_main_p.offset) c_main_p.offset) 0) (<= (- c_main_p.offset c_main_q.offset) 0) (<= (- (- |c_main_~malloc_#res.offset|) (- v_v_21_1)) 400) (<= (- v_b_4_1 v_b_9_1) (- 1)) (= (select |c_old(#length)| v_idx_12) v_v_4_1) (<= (- (- c_main_p.offset) (- c_main_q.offset)) 0) (<= (- c_main_q.offset v_v_21_1) (- 400)) (<= (- c_main_q.offset (- v_v_21_1)) 400) (<= (- (- v_b_4_1) (- v_b_5_1)) 1) (<= (- (- v_b_5_1) (- |c_main_~malloc_#res.base|)) (- 1)) (<= (- (- v_b_9_1) (- |c_main_~malloc_#res.base|)) (- 1)) (or (< v_idx_11 v_b_5_1) (= (select |c_#valid| v_idx_11) v_v_16_1)) (<= (- v_b_4_1 v_b_5_1) (- 1)) (<= (- v_b_8_1 v_b_9_1) (- 1)) (<= (- (- |c_main_~malloc_#res.offset|) (- c_main_~malloc_~size)) 400) (<= (- v_b_9_1 |c_main_~malloc_#res.base|) 1) (or (< v_idx_15 v_b_9_1) (= v_v_22_1 (select |c_#length| v_idx_15))) (= (select |c_main_~malloc_old_#length| v_idx_7) v_v_3_1) (or (< v_idx_14 v_b_8_1) (= (select |c_#length| v_idx_14) v_v_21_1) (<= v_b_9_1 v_idx_14)) (<= (- |c_main_~malloc_#res.offset| (- v_v_21_1)) 400) (<= (- (- c_main_~malloc_~size) (- v_v_21_1)) 0) (<= (- c_main_p.offset c_main_~malloc_~size) (- 400)) (<= (- v_v_21_1 (- v_v_21_1)) 800) (<= (- (- c_main_p.offset) c_main_q.offset) 0) (<= (- c_main_p.offset (- |c_main_~malloc_#res.offset|)) 0) (<= (- (- c_main_p.offset) c_main_~malloc_~size) (- 400)) (<= (- c_main_q.offset (- c_main_~malloc_~size)) 400) (<= (- |c_main_~malloc_#res.offset| c_main_~malloc_~size) (- 400)) (<= (- v_b_8_1 |c_main_~malloc_#res.base|) 0) (<= (- c_main_q.offset (- c_main_q.offset)) 0) (<= (- (- v_v_21_1) v_v_21_1) (- 800)) (<= (- (- c_main_q.offset) (- v_v_21_1)) 400) (<= (- (- c_main_q.offset) (- |c_main_~malloc_#res.offset|)) 0) (<= (- (- c_main_q.offset) (- c_main_~malloc_~size)) 400) (<= (- |c_main_~malloc_#res.offset| v_v_21_1) (- 400)) (<= (- (- |c_main_~malloc_#res.offset|) |c_main_~malloc_#res.offset|) 0) (<= (- (- v_b_5_1) (- v_b_9_1)) 0) (<= (- (- v_b_4_1) (- v_b_9_1)) 1) (<= (- v_b_5_1 v_b_8_1) 1) (<= (- c_main_p.offset (- c_main_~malloc_~size)) 400) (<= (- c_main_~malloc_~size (- c_main_~malloc_~size)) 800) (<= (- c_main_p.offset (- c_main_p.offset)) 0) (<= (- (- c_main_~malloc_~size) c_main_~malloc_~size) (- 800)) (<= (- (- c_main_p.offset) (- c_main_~malloc_~size)) 400) (<= (- c_main_p.offset |c_main_~malloc_#res.offset|) 0) (<= (- (- v_b_4_1) (- v_b_8_1)) 0) (<= (- (- c_main_q.offset) |c_main_~malloc_#res.offset|) 0) (<= (- (- c_main_p.offset) v_v_21_1) (- 400)) (= v_v_8_1 (select |c_main_~malloc_old_#valid| v_idx_16)) (<= (- |c_main_~malloc_#res.offset| (- |c_main_~malloc_#res.offset|)) 0) (<= (- c_main_~malloc_~size (- v_v_21_1)) 800) (<= (- (- v_b_5_1) (- v_b_8_1)) (- 1)) (<= (- (- c_main_p.offset) |c_main_~malloc_#res.offset|) 0) (or (<= v_b_8_1 v_idx_13) (= (select |c_#length| v_idx_13) v_v_20_1)) (<= (- (- c_main_q.offset) c_main_q.offset) 0) (<= (- c_main_q.offset c_main_~malloc_~size) (- 400)) (or (<= v_b_4_1 v_idx_9) (= (select |c_#valid| v_idx_9) v_v_14_1)) (<= (- (- v_b_8_1) (- v_b_9_1)) 1) (<= (- v_b_4_1 |c_main_~malloc_#res.base|) 0) (<= (- c_main_p.offset (- c_main_q.offset)) 0) (<= (- (- c_main_q.offset) v_v_21_1) (- 400)) (<= (- v_b_4_1 v_b_8_1) 0) (<= (- (- |c_main_~malloc_#res.offset|) v_v_21_1) (- 400)) (<= (- c_main_q.offset |c_main_~malloc_#res.offset|) 0) (<= (- (- c_main_p.offset) (- |c_main_~malloc_#res.offset|)) 0) (<= (- (- c_main_q.offset) c_main_~malloc_~size) (- 400)) (<= (- v_b_5_1 v_b_9_1) 0) (<= (- v_b_5_1 |c_main_~malloc_#res.base|) 1) (= (select |c_old(#valid)| v_idx_8) v_v_2_1) (<= (- c_main_p.offset v_v_21_1) (- 400)))))} [2018-12-23 14:32:45,238 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:32:45,419 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:32:45,419 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:32:47,624 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.processDualQuantifier(QuantifierPusher.java:374) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:118) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:88) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.toStringSimplified(DebuggingHoareTripleChecker.java:308) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.logUnsoundness(DebuggingHoareTripleChecker.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkValidity(DebuggingHoareTripleChecker.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkValidity(DebuggingHoareTripleChecker.java:179) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkInternal(DebuggingHoareTripleChecker.java:139) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:80) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:62) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.assertIsPostSound(FixpointEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:254) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-12-23 14:32:47,628 INFO L168 Benchmark]: Toolchain (without parser) took 6910.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-12-23 14:32:47,632 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:32:47,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:32:47,634 INFO L168 Benchmark]: Boogie Preprocessor took 35.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:32:47,635 INFO L168 Benchmark]: RCFGBuilder took 501.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-23 14:32:47,637 INFO L168 Benchmark]: TraceAbstraction took 6298.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-12-23 14:32:47,642 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 501.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6298.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...