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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-4b9831f [2018-12-23 14:32:17,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:32:17,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:32:17,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:32:17,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:32:17,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:32:17,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:32:17,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:32:17,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:32:17,545 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:32:17,554 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:32:17,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:32:17,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:32:17,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:32:17,559 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:32:17,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:32:17,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:32:17,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:32:17,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:32:17,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:32:17,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:32:17,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:32:17,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:32:17,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:32:17,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:32:17,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:32:17,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:32:17,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:32:17,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:32:17,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:32:17,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:32:17,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:32:17,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:32:17,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:32:17,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:32:17,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:32:17,599 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:17,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:32:17,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:32:17,618 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:32:17,618 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:32:17,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:32:17,619 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:32:17,619 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:32:17,619 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:32:17,619 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:32:17,619 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-23 14:32:17,620 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-23 14:32:17,620 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:32:17,620 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:32:17,621 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:32:17,621 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:32:17,621 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:32:17,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:32:17,621 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:32:17,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:32:17,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:32:17,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:32:17,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:32:17,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:32:17,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:32:17,623 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:32:17,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:32:17,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:32:17,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:32:17,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:32:17,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:32:17,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:32:17,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:32:17,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:32:17,625 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:32:17,625 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:32:17,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:32:17,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:32:17,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:32:17,626 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:32:17,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:32:17,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:32:17,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:32:17,693 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:32:17,694 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:32:17,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-12-23 14:32:17,696 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-12-23 14:32:17,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:32:17,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:32:17,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:32:17,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:32:17,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:32:17,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:32:17,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:32:17,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:32:17,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:32:17,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... [2018-12-23 14:32:17,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:32:17,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:32:17,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:32:17,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:32:17,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-23 14:32:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-23 14:32:18,424 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-23 14:32:18,425 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-23 14:32:18,425 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:32:18 BoogieIcfgContainer [2018-12-23 14:32:18,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:32:18,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:32:18,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:32:18,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:32:18,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:32:17" (1/2) ... [2018-12-23 14:32:18,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdc58ce and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:32:18, skipping insertion in model container [2018-12-23 14:32:18,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:32:18" (2/2) ... [2018-12-23 14:32:18,435 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-12-23 14:32:18,446 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:32:18,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-23 14:32:18,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-23 14:32:18,511 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:32:18,512 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:32:18,512 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:32:18,512 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:32:18,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:32:18,512 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:32:18,512 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:32:18,513 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:32:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-12-23 14:32:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-23 14:32:18,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:32:18,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-23 14:32:18,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-23 14:32:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:32:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-12-23 14:32:18,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:32:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:18,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:32:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:18,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:32:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:32:18,839 INFO L273 TraceCheckUtils]: 0: Hoare triple {16#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {16#true} is VALID [2018-12-23 14:32:18,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;~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];main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} is VALID [2018-12-23 14:32:18,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} is VALID [2018-12-23 14:32:18,865 INFO L273 TraceCheckUtils]: 3: Hoare triple {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} assume main_#t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~q~1.base, main_~q~1.offset, 4; {19#(select |#valid| |ULTIMATE.start_read~int_#ptr.base|)} is VALID [2018-12-23 14:32:18,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {19#(select |#valid| |ULTIMATE.start_read~int_#ptr.base|)} assume !#valid[read~int_#ptr.base]; {17#false} is VALID [2018-12-23 14:32:18,871 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:18,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:32:18,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-23 14:32:18,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:32:18,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-23 14:32:18,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:32:18,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:32:18,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:18,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:32:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:32:18,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-23 14:32:18,932 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-12-23 14:32:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:19,396 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-23 14:32:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:32:19,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-23 14:32:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:32:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:32:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-23 14:32:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:32:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-23 14:32:19,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-12-23 14:32:19,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:19,482 INFO L225 Difference]: With dead ends: 24 [2018-12-23 14:32:19,482 INFO L226 Difference]: Without dead ends: 11 [2018-12-23 14:32:19,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-23 14:32:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-23 14:32:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-12-23 14:32:19,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:32:19,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 8 states. [2018-12-23 14:32:19,533 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 8 states. [2018-12-23 14:32:19,533 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 8 states. [2018-12-23 14:32:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:19,536 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-23 14:32:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-23 14:32:19,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:19,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:19,537 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 11 states. [2018-12-23 14:32:19,538 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 11 states. [2018-12-23 14:32:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:19,540 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-23 14:32:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-23 14:32:19,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:19,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:19,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:32:19,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:32:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:32:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-23 14:32:19,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-23 14:32:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:32:19,545 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-23 14:32:19,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:32:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-23 14:32:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-23 14:32:19,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:32:19,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-23 14:32:19,547 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-23 14:32:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:32:19,548 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-12-23 14:32:19,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:32:19,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:19,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:32:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:19,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:32:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:32:19,884 INFO L273 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {84#true} is VALID [2018-12-23 14:32:19,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;~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];main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {86#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= 0 ULTIMATE.start_main_~q~1.offset))} is VALID [2018-12-23 14:32:19,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {86#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= 0 ULTIMATE.start_main_~q~1.offset))} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {86#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= 0 ULTIMATE.start_main_~q~1.offset))} is VALID [2018-12-23 14:32:19,920 INFO L273 TraceCheckUtils]: 3: Hoare triple {86#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= 0 ULTIMATE.start_main_~q~1.offset))} assume main_#t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~q~1.base, main_~q~1.offset, 4; {87#(and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| 396) (select |#length| |ULTIMATE.start_read~int_#ptr.base|)) (= |ULTIMATE.start_read~int_#ptr.offset| 0))} is VALID [2018-12-23 14:32:19,934 INFO L273 TraceCheckUtils]: 4: Hoare triple {87#(and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| 396) (select |#length| |ULTIMATE.start_read~int_#ptr.base|)) (= |ULTIMATE.start_read~int_#ptr.offset| 0))} assume #valid[read~int_#ptr.base]; {87#(and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| 396) (select |#length| |ULTIMATE.start_read~int_#ptr.base|)) (= |ULTIMATE.start_read~int_#ptr.offset| 0))} is VALID [2018-12-23 14:32:19,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {87#(and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| 396) (select |#length| |ULTIMATE.start_read~int_#ptr.base|)) (= |ULTIMATE.start_read~int_#ptr.offset| 0))} assume !(read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]); {85#false} is VALID [2018-12-23 14:32:19,948 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:19,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:32:19,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-23 14:32:19,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:32:19,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-23 14:32:19,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:32:19,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:32:19,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:19,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:32:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:32:19,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-23 14:32:19,999 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-23 14:32:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:20,391 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-23 14:32:20,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-23 14:32:20,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-23 14:32:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:32:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:32:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-23 14:32:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:32:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-23 14:32:20,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2018-12-23 14:32:20,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:20,493 INFO L225 Difference]: With dead ends: 18 [2018-12-23 14:32:20,493 INFO L226 Difference]: Without dead ends: 17 [2018-12-23 14:32:20,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-23 14:32:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-23 14:32:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-23 14:32:20,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:32:20,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 12 states. [2018-12-23 14:32:20,508 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 12 states. [2018-12-23 14:32:20,509 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 12 states. [2018-12-23 14:32:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:20,511 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-23 14:32:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-12-23 14:32:20,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:20,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:20,512 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 17 states. [2018-12-23 14:32:20,513 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 17 states. [2018-12-23 14:32:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:20,515 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-23 14:32:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-12-23 14:32:20,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:20,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:20,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:32:20,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:32:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-23 14:32:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-23 14:32:20,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-12-23 14:32:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:32:20,518 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-23 14:32:20,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:32:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-23 14:32:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-23 14:32:20,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:32:20,519 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:32:20,519 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-23 14:32:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:32:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-12-23 14:32:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:32:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:20,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:32:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:20,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:32:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:32:20,692 INFO L273 TraceCheckUtils]: 0: Hoare triple {161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {161#true} is VALID [2018-12-23 14:32:20,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {161#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;~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];main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {161#true} is VALID [2018-12-23 14:32:20,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {161#true} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {161#true} is VALID [2018-12-23 14:32:20,707 INFO L273 TraceCheckUtils]: 3: Hoare triple {161#true} assume !main_#t~short2; {163#(not |ULTIMATE.start_main_#t~short2|)} is VALID [2018-12-23 14:32:20,722 INFO L273 TraceCheckUtils]: 4: Hoare triple {163#(not |ULTIMATE.start_main_#t~short2|)} assume !!main_#t~short2;havoc main_#t~mem1;havoc main_#t~short2;main_#t~post3.base, main_#t~post3.offset := main_~q~1.base, main_~q~1.offset;main_~q~1.base, main_~q~1.offset := main_#t~post3.base, main_#t~post3.offset + 4;havoc main_#t~post3.base, main_#t~post3.offset; {162#false} is VALID [2018-12-23 14:32:20,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {162#false} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {162#false} is VALID [2018-12-23 14:32:20,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {162#false} assume main_#t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~q~1.base, main_~q~1.offset, 4; {162#false} is VALID [2018-12-23 14:32:20,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {162#false} assume #valid[read~int_#ptr.base]; {162#false} is VALID [2018-12-23 14:32:20,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {162#false} assume !(read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]); {162#false} is VALID [2018-12-23 14:32:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:32:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:32:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-23 14:32:20,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:32:20,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-23 14:32:20,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:32:20,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:32:20,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:20,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:32:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:32:20,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:32:20,853 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-12-23 14:32:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:20,975 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-23 14:32:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:32:20,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-23 14:32:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:32:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:32:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-23 14:32:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:32:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-23 14:32:20,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2018-12-23 14:32:21,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:32:21,010 INFO L225 Difference]: With dead ends: 19 [2018-12-23 14:32:21,010 INFO L226 Difference]: Without dead ends: 12 [2018-12-23 14:32:21,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-23 14:32:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-23 14:32:21,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:32:21,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-12-23 14:32:21,024 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-23 14:32:21,024 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-23 14:32:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:21,026 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-23 14:32:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-23 14:32:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:21,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:21,027 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-23 14:32:21,027 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-23 14:32:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:32:21,029 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-23 14:32:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-23 14:32:21,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:32:21,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:32:21,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:32:21,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:32:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-23 14:32:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-23 14:32:21,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-23 14:32:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:32:21,032 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-23 14:32:21,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:32:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-23 14:32:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-23 14:32:21,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:32:21,033 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-23 14:32:21,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-12-23 14:32:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:32:21,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-12-23 14:32:21,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:32:21,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:21,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:32:21,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:32:21,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:32:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:32:21,209 INFO L273 TraceCheckUtils]: 0: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {226#true} is VALID [2018-12-23 14:32:21,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;~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];main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-23 14:32:21,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-23 14:32:21,212 INFO L273 TraceCheckUtils]: 3: Hoare triple {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} assume main_#t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~q~1.base, main_~q~1.offset, 4; {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-23 14:32:21,213 INFO L273 TraceCheckUtils]: 4: Hoare triple {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} assume #valid[read~int_#ptr.base]; {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-23 14:32:21,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} assume read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base];assume #valid[read~int_#ptr.base];assume read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base];havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem1 := read~int_#value;main_#t~short2 := main_#t~mem1 >= 0; {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-23 14:32:21,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {228#(and (<= 400 (select |#length| ULTIMATE.start_main_~q~1.base)) (= ULTIMATE.start_main_~q~1.offset 0))} assume !!main_#t~short2;havoc main_#t~mem1;havoc main_#t~short2;main_#t~post3.base, main_#t~post3.offset := main_~q~1.base, main_~q~1.offset;main_~q~1.base, main_~q~1.offset := main_#t~post3.base, main_#t~post3.offset + 4;havoc main_#t~post3.base, main_#t~post3.offset; {229#(<= (+ ULTIMATE.start_main_~q~1.offset 396) (select |#length| ULTIMATE.start_main_~q~1.base))} is VALID [2018-12-23 14:32:21,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {229#(<= (+ ULTIMATE.start_main_~q~1.offset 396) (select |#length| ULTIMATE.start_main_~q~1.base))} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {229#(<= (+ ULTIMATE.start_main_~q~1.offset 396) (select |#length| ULTIMATE.start_main_~q~1.base))} is VALID [2018-12-23 14:32:21,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {229#(<= (+ ULTIMATE.start_main_~q~1.offset 396) (select |#length| ULTIMATE.start_main_~q~1.base))} assume main_#t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~q~1.base, main_~q~1.offset, 4; {230#(<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 392) (select |#length| |ULTIMATE.start_read~int_#ptr.base|))} is VALID [2018-12-23 14:32:21,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {230#(<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 392) (select |#length| |ULTIMATE.start_read~int_#ptr.base|))} assume #valid[read~int_#ptr.base]; {230#(<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 392) (select |#length| |ULTIMATE.start_read~int_#ptr.base|))} is VALID [2018-12-23 14:32:21,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {230#(<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 392) (select |#length| |ULTIMATE.start_read~int_#ptr.base|))} assume !(read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]); {227#false} is VALID [2018-12-23 14:32:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:32:21,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:32:21,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:32:21,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-23 14:32:21,226 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2018-12-23 14:32:21,283 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-23 14:32:21,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:32:21,431 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-23 14:32:21,432 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-23 14:32:21,435 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:32:21,435 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:32:21,436 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_7 Int) (v_idx_8 Int) (v_idx_9 Int) (v_idx_3 Int) (v_idx_10 Int) (v_idx_4 Int) (v_idx_5 Int) (v_idx_6 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_8_1 Int) (v_v_3_1 Bool) (v_v_9_1 Int) (v_v_2_1 Bool) (v_v_4_1 Bool) (v_v_7_1 (Array Int Int)) (v_v_0_1 Int) (v_v_1_1 Int) (v_v_5_1 (Array Int Int)) (v_v_6_1 Int)) (and (= (select v_v_7_1 v_idx_6) v_v_8_1) (= (select |c_old(#valid)| v_idx_3) v_v_4_1) (= (select |c_old(#length)| v_idx_8) v_v_1_1) (= v_v_5_1 (select |c_#memory_int| v_idx_4)) (= (select |c_old(#memory_int)| v_idx_5) v_v_7_1) (= (select |c_ULTIMATE.start_~malloc_old_#length| v_idx_10) v_v_9_1) (= (select |c_#valid| v_idx_2) v_v_3_1) (= v_v_6_1 (select v_v_5_1 v_idx_9)) (= v_v_2_1 (select |c_ULTIMATE.start_~malloc_old_#valid| v_idx_1)) (= v_v_0_1 (select |c_#length| v_idx_7)))))} [2018-12-23 14:32:21,436 WARN L228 ngHoareTripleChecker]: Action: #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; [2018-12-23 14:32:21,437 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= |c_#NULL.offset_primed| 0) (= |c_#NULL.base_primed| 0) (= |c_#valid_primed| (store |c_#valid| 0 false))) [2018-12-23 14:32:21,437 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_14 Int) (v_idx_15 Int) (v_idx_12 Int) (v_idx_13 Int) (v_idx_21 Int) (v_idx_22 Int) (v_idx_11 Int) (v_idx_20 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_16 Int) (v_idx_17 Int)) (exists ((v_v_2_1 Bool) (v_v_4_1 Bool) (v_v_8_1 Int) (v_v_9_1 Int) (v_v_7_1 (Array Int Int)) (v_v_0_1 Int) (v_v_12_1 Bool) (v_v_11_1 Bool) (v_v_1_1 Int) (v_v_5_1 (Array Int Int)) (v_b_0_1 Int) (v_v_6_1 Int) (v_v_10_1 Bool) (v_b_1_1 Int)) (and (<= (- (- |c_#NULL.offset|) |c_#NULL.offset|) 0) (<= (- (- |c_#NULL.base|) (- v_b_1_1)) 1) (<= (- |c_#NULL.offset| (- v_b_1_1)) 1) (= (select |c_old(#valid)| v_idx_12) v_v_4_1) (or (<= v_b_1_1 v_idx_14) (< v_idx_14 v_b_0_1) (= v_v_11_1 (select |c_#valid| v_idx_14))) (<= (- |c_#NULL.base| v_b_1_1) (- 1)) (<= (- (- |c_#NULL.base|) |c_#NULL.base|) 0) (<= (- v_b_0_1 (- v_b_1_1)) 1) (<= (- |c_#NULL.base| (- v_b_1_1)) 1) (<= (- (- v_b_0_1) v_b_1_1) (- 1)) (<= (- (- |c_#NULL.offset|) (- v_b_1_1)) 1) (<= (- (- |c_#NULL.offset|) v_b_1_1) (- 1)) (<= (- (- |c_#NULL.base|) v_b_0_1) 0) (= (select v_v_5_1 v_idx_21) v_v_6_1) (<= (- |c_#NULL.base| |c_#NULL.offset|) 0) (<= (- (- |c_#NULL.base|) v_b_1_1) (- 1)) (<= (- |c_#NULL.offset| v_b_1_1) (- 1)) (<= (- v_b_1_1 (- v_b_1_1)) 2) (<= (- |c_#NULL.offset| (- v_b_0_1)) 0) (<= (- |c_#NULL.base| v_b_0_1) 0) (= v_v_7_1 (select |c_old(#memory_int)| v_idx_17)) (<= (- |c_#NULL.offset| (- |c_#NULL.offset|)) 0) (= v_v_9_1 (select |c_ULTIMATE.start_~malloc_old_#length| v_idx_22)) (= (select |c_ULTIMATE.start_~malloc_old_#valid| v_idx_11) v_v_2_1) (<= (- (- |c_#NULL.offset|) (- v_b_0_1)) 0) (<= (- (- v_b_0_1) (- v_b_1_1)) 1) (<= (- |c_#NULL.base| (- v_b_0_1)) 0) (<= (- (- v_b_1_1) v_b_1_1) (- 2)) (= v_v_8_1 (select v_v_7_1 v_idx_18)) (<= (- v_b_0_1 v_b_1_1) (- 1)) (= v_v_5_1 (select |c_#memory_int| v_idx_16)) (= v_v_0_1 (select |c_#length| v_idx_19)) (<= (- |c_#NULL.base| (- |c_#NULL.base|)) 0) (or (= (select |c_#valid| v_idx_13) v_v_10_1) (<= v_b_0_1 v_idx_13)) (= (select |c_old(#length)| v_idx_20) v_v_1_1) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- (- |c_#NULL.offset|) v_b_0_1) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- |c_#NULL.base| (- |c_#NULL.offset|)) 0) (not v_v_11_1) (or (= (select |c_#valid| v_idx_15) v_v_12_1) (< v_idx_15 v_b_1_1)) (<= (- (- |c_#NULL.base|) (- |c_#NULL.offset|)) 0) (<= (- |c_#NULL.offset| v_b_0_1) 0) (<= (- (- |c_#NULL.base|) |c_#NULL.offset|) 0) (<= (- (- |c_#NULL.base|) (- v_b_0_1)) 0))))} [2018-12-23 14:32:21,438 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:32:21,438 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:32:21,439 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:32:21,585 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:21,589 INFO L168 Benchmark]: Toolchain (without parser) took 3812.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-12-23 14:32:21,591 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:32:21,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:32:21,593 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:32:21,593 INFO L168 Benchmark]: RCFGBuilder took 532.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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:21,595 INFO L168 Benchmark]: TraceAbstraction took 3160.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-12-23 14:32:21,600 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 532.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 3160.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 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...