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/heapseparator/speedup-poc-dd-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-4b9831f [2018-12-23 14:40:59,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:41:00,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:41:00,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:41:00,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:41:00,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:41:00,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:41:00,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:41:00,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:41:00,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:41:00,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:41:00,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:41:00,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:41:00,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:41:00,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:41:00,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:41:00,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:41:00,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:41:00,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:41:00,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:41:00,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:41:00,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:41:00,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:41:00,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:41:00,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:41:00,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:41:00,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:41:00,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:41:00,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:41:00,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:41:00,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:41:00,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:41:00,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:41:00,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:41:00,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:41:00,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:41:00,060 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:41:00,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:41:00,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:41:00,075 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:41:00,076 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:41:00,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:41:00,077 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:41:00,077 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:41:00,077 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:41:00,077 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:41:00,078 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-23 14:41:00,078 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-23 14:41:00,078 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:41:00,078 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:41:00,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:41:00,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:41:00,080 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:41:00,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:41:00,080 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:41:00,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:41:00,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:41:00,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:41:00,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:41:00,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:41:00,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:41:00,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:41:00,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:41:00,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:41:00,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:41:00,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:41:00,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:41:00,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:41:00,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:41:00,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:41:00,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:41:00,087 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:41:00,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:41:00,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:41:00,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:41:00,087 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:41:00,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:41:00,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:41:00,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:41:00,149 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:41:00,150 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:41:00,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2018-12-23 14:41:00,151 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2018-12-23 14:41:00,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:41:00,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:41:00,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:41:00,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:41:00,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:41:00,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:41:00,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:41:00,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:41:00,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:41:00,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/1) ... [2018-12-23 14:41:00,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:41:00,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:41:00,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:41:00,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:41:00,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (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:41:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-23 14:41:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-23 14:41:01,260 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-23 14:41:01,261 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-23 14:41:01,261 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:41:01 BoogieIcfgContainer [2018-12-23 14:41:01,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:41:01,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:41:01,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:41:01,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:41:01,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:41:00" (1/2) ... [2018-12-23 14:41:01,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cac459 and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:41:01, skipping insertion in model container [2018-12-23 14:41:01,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:41:01" (2/2) ... [2018-12-23 14:41:01,270 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2018-12-23 14:41:01,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:41:01,289 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-23 14:41:01,307 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-23 14:41:01,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:41:01,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:41:01,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:41:01,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:41:01,343 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:41:01,343 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:41:01,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:41:01,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:41:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-23 14:41:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-23 14:41:01,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:41:01,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-23 14:41:01,371 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:41:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:41:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2018-12-23 14:41:01,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:41:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:41:01,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:41:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:41:01,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:41:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:41:01,718 INFO L273 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-23 14:41:01,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {21#false} is VALID [2018-12-23 14:41:01,737 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:41:01,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:41:01,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-23 14:41:01,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:41:01,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-23 14:41:01,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:41:01,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:41:01,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:41:01,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:41:01,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:41:01,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:41:01,800 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-23 14:41:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:41:02,277 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-12-23 14:41:02,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:41:02,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-23 14:41:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:41:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:41:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-23 14:41:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:41:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-23 14:41:02,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-12-23 14:41:02,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:41:02,502 INFO L225 Difference]: With dead ends: 33 [2018-12-23 14:41:02,503 INFO L226 Difference]: Without dead ends: 28 [2018-12-23 14:41:02,508 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:41:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-23 14:41:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-23 14:41:02,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:41:02,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2018-12-23 14:41:02,580 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2018-12-23 14:41:02,580 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2018-12-23 14:41:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:41:02,585 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-23 14:41:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-23 14:41:02,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:41:02,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:41:02,587 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2018-12-23 14:41:02,587 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2018-12-23 14:41:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:41:02,591 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-23 14:41:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-23 14:41:02,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:41:02,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:41:02,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:41:02,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:41:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-23 14:41:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-23 14:41:02,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2018-12-23 14:41:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:41:02,597 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-23 14:41:02,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:41:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-23 14:41:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:41:02,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:41:02,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:41:02,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:41:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:41:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2018-12-23 14:41:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:41:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:41:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:41:02,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:41:02,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:41:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:41:02,685 INFO L273 TraceCheckUtils]: 0: Hoare triple {134#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-23 14:41:02,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-23 14:41:02,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {135#false} is VALID [2018-12-23 14:41:02,691 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:41:02,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:41:02,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-23 14:41:02,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:41:02,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:41:02,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:41:02,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:41:02,704 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:41:02,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:41:02,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:41:02,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:41:02,705 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2018-12-23 14:41:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:41:03,265 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-23 14:41:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:41:03,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:41:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:41:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:41:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-23 14:41:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:41:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-23 14:41:03,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-12-23 14:41:03,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:41:03,342 INFO L225 Difference]: With dead ends: 28 [2018-12-23 14:41:03,343 INFO L226 Difference]: Without dead ends: 27 [2018-12-23 14:41:03,344 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:41:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-23 14:41:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-23 14:41:03,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:41:03,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2018-12-23 14:41:03,353 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2018-12-23 14:41:03,353 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2018-12-23 14:41:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:41:03,356 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-23 14:41:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-23 14:41:03,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:41:03,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:41:03,358 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2018-12-23 14:41:03,358 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2018-12-23 14:41:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:41:03,361 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-23 14:41:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-23 14:41:03,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:41:03,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:41:03,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:41:03,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:41:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-23 14:41:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-12-23 14:41:03,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2018-12-23 14:41:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:41:03,365 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2018-12-23 14:41:03,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:41:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2018-12-23 14:41:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:41:03,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:41:03,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:41:03,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:41:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:41:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2018-12-23 14:41:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:41:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:41:03,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:41:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:41:03,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:41:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:41:03,551 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-23 14:41:03,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-23 14:41:03,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {243#false} is VALID [2018-12-23 14:41:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:41:03,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:41:03,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:41:03,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-23 14:41:03,559 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2018-12-23 14:41:03,621 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-23 14:41:03,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:41:07,624 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-23 14:41:07,625 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-23 14:41:07,626 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:41:07,627 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:41:07,627 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_3 Int) (v_idx_4 Int) (v_idx_5 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_0_1 Int) (v_v_1_1 Int) (v_v_2_1 Int) (v_v_3_1 Int) (v_v_4_1 Int)) (and (= (select |c_old(#memory_int)| v_idx_5) v_v_4_1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1) v_v_0_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_3)) (= v_v_1_1 (select |c_#valid| v_idx_2)) (= v_v_3_1 (select |c_#memory_int| v_idx_4)))))} [2018-12-23 14:41:07,627 WARN L228 ngHoareTripleChecker]: Action: havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; [2018-12-23 14:41:07,628 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed 1) |c_#valid_primed|) (= (store (store (store (store (store (store (store |c_#memory_int| c_ULTIMATE.start_main_p1_primed 0) c_ULTIMATE.start_main_p2_primed 0) c_ULTIMATE.start_main_p3_primed 0) c_ULTIMATE.start_main_p4_primed 0) c_ULTIMATE.start_main_p5_primed 0) c_ULTIMATE.start_main_p6_primed 0) c_ULTIMATE.start_main_p7_primed 0) |c_#memory_int_primed|) (= 0 (select (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed)) (= c_ULTIMATE.start_main_p7_primed c_ULTIMATE.start_malloc_ptr_primed) (= (store (store (store (store (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed 1) c_ULTIMATE.start_main_p4_primed 1) c_ULTIMATE.start_main_p5_primed 1) c_ULTIMATE.start_main_p6_primed 1) |c_ULTIMATE.start_malloc_old_#valid_primed|) (= 0 (select (store (store (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed 1) c_ULTIMATE.start_main_p4_primed 1) c_ULTIMATE.start_main_p5_primed)) (= 0 (select |c_#valid| c_ULTIMATE.start_main_p1_primed)) (= (select (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed) 0) (= (select (store (store (store (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed 1) c_ULTIMATE.start_main_p4_primed 1) c_ULTIMATE.start_main_p5_primed 1) c_ULTIMATE.start_main_p6_primed) 0) (= (select |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed) 0) (= 0 (select (store (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed 1) c_ULTIMATE.start_main_p4_primed))) [2018-12-23 14:41:07,629 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_6 Int) (v_idx_16 Int)) (exists ((v_v_66_1 Int) (v_v_67_1 Int) (v_v_68_1 Int) (v_v_74_1 Int) (v_v_73_1 Int) (v_v_95_1 Int) (v_b_54_1 Int) (v_b_40_1 Int) (v_b_41_1 Int) (v_v_94_1 Int) (v_v_2_1 Int) (v_b_37_1 Int) (v_v_72_1 Int) (v_v_93_1 Int) (v_v_4_1 Int) (v_b_36_1 Int) (v_b_55_1 Int)) (and (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_55_1)) 1) (<= (- v_b_41_1 v_b_54_1) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_54_1)) 0) (= v_v_2_1 (select |c_old(#valid)| v_idx_13)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_41_1) (- 1)) (<= (- (- v_b_36_1) (- v_b_41_1)) 1) (<= (- c_ULTIMATE.start_main_p7 v_b_55_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_37_1)) 1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_40_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_55_1) (- 1)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_12) v_v_68_1) (< v_idx_12 v_b_37_1)) (<= (- v_b_36_1 v_b_55_1) (- 1)) (<= (- v_b_54_1 v_b_55_1) (- 1)) (<= (- c_ULTIMATE.start_main_p7 v_b_36_1) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_41_1)) 1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_55_1)) 1) (<= (- c_ULTIMATE.start_main_p7 v_b_40_1) 0) (<= (- c_ULTIMATE.start_main_p7 v_b_41_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_41_1)) 1) (or (= (select |c_#valid| v_idx_16) v_v_74_1) (< v_idx_16 v_b_41_1)) (<= (- v_b_37_1 v_b_41_1) 0) (<= (- v_b_40_1 v_b_41_1) (- 1)) (<= (- c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) 0) (<= (- (- v_b_36_1) (- v_b_40_1)) 0) (<= (- (- v_b_40_1) (- v_b_55_1)) 1) (<= (- (- v_b_54_1) (- v_b_55_1)) 1) (<= (- v_v_94_1 (- v_v_94_1)) 0) (<= (- (- c_ULTIMATE.start_main_p7) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- v_v_67_1 (- v_v_73_1)) 1) (<= (- (- v_b_41_1) (- v_b_55_1)) 0) (<= (- v_v_67_1 (- v_v_94_1)) 0) (or (<= v_b_54_1 v_idx_7) (= (select |c_#memory_int| v_idx_7) v_v_93_1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_40_1)) 0) (<= (- (- v_b_36_1) (- v_b_55_1)) 1) (<= (- c_ULTIMATE.start_main_p7 v_b_37_1) (- 1)) (<= (- (- v_b_40_1) (- v_b_54_1)) 0) (<= (- v_b_37_1 v_b_54_1) 1) (<= (- (- v_b_37_1) (- v_b_40_1)) (- 1)) (<= (- (- v_v_67_1) (- v_v_94_1)) 0) (<= (- c_ULTIMATE.start_main_p7 v_b_54_1) 0) (<= (- (- v_v_73_1) v_v_73_1) (- 2)) (<= (- v_b_41_1 v_b_55_1) 0) (<= (- v_v_73_1 v_v_94_1) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_36_1) 0) (<= (- v_b_36_1 v_b_41_1) (- 1)) (<= (- v_b_36_1 v_b_37_1) (- 1)) (<= (- (- v_b_36_1) (- v_b_37_1)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_54_1) 0) (<= (- v_b_40_1 v_b_54_1) 0) (<= (- v_b_37_1 v_b_55_1) 0) (<= (- (- v_v_67_1) (- v_v_73_1)) 1) (<= (- v_v_67_1 v_v_73_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_36_1)) 0) (<= (- (- v_v_73_1) v_v_94_1) (- 1)) (or (= v_v_94_1 (select |c_#memory_int| v_idx_8)) (<= v_b_55_1 v_idx_8) (< v_idx_8 v_b_54_1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_40_1) 0) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_36_1)) 0) (<= (- v_b_40_1 v_b_55_1) (- 1)) (<= (- v_v_73_1 (- v_v_94_1)) 1) (<= (- (- v_v_94_1) v_v_94_1) 0) (<= (- (- v_b_40_1) (- v_b_41_1)) 1) (<= (- v_b_36_1 v_b_40_1) 0) (<= (- (- v_b_37_1) (- v_b_41_1)) 0) (or (< v_idx_9 v_b_55_1) (= (select |c_#memory_int| v_idx_9) v_v_95_1)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_11) v_v_67_1) (< v_idx_11 v_b_36_1) (<= v_b_37_1 v_idx_11)) (<= (- (- v_b_37_1) (- v_b_54_1)) (- 1)) (<= (- v_b_36_1 v_b_54_1) 0) (or (<= v_b_36_1 v_idx_10) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_10) v_v_66_1)) (<= (- (- v_b_41_1) (- v_b_54_1)) (- 1)) (<= (- v_v_67_1 (- v_v_67_1)) 0) (<= (- v_b_37_1 v_b_40_1) 1) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_54_1)) 0) (<= (- (- v_v_67_1) v_v_67_1) 0) (<= (- v_v_73_1 (- v_v_73_1)) 2) (<= (- (- c_ULTIMATE.start_main_p7) (- v_b_37_1)) 1) (<= (- (- v_b_36_1) (- v_b_54_1)) 0) (<= (- (- v_v_67_1) v_v_73_1) (- 1)) (<= (- (- v_b_37_1) (- v_b_55_1)) 0) (<= (- v_v_67_1 v_v_94_1) 0) (or (= (select |c_#valid| v_idx_15) v_v_73_1) (<= v_b_41_1 v_idx_15) (< v_idx_15 v_b_40_1)) (<= (- (- v_v_73_1) (- v_v_94_1)) (- 1)) (or (<= v_b_40_1 v_idx_14) (= (select |c_#valid| v_idx_14) v_v_72_1)) (<= (- (- v_v_67_1) v_v_94_1) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_37_1) (- 1)) (= (select |c_old(#memory_int)| v_idx_6) v_v_4_1))))} [2018-12-23 14:41:07,629 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:41:07,630 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:41:07,631 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:41:07,710 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:41:07,721 INFO L168 Benchmark]: Toolchain (without parser) took 7526.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -628.3 MB). Peak memory consumption was 154.9 MB. Max. memory is 7.1 GB. [2018-12-23 14:41:07,724 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:41:07,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.21 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:41:07,729 INFO L168 Benchmark]: Boogie Preprocessor took 27.45 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:41:07,730 INFO L168 Benchmark]: RCFGBuilder took 955.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-23 14:41:07,733 INFO L168 Benchmark]: TraceAbstraction took 6456.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -660.0 MB). Peak memory consumption was 123.2 MB. Max. memory is 7.1 GB. [2018-12-23 14:41:07,747 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.20 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 82.21 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 27.45 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 955.10 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6456.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -660.0 MB). Peak memory consumption was 123.2 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...