java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:12:16,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:12:16,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:12:16,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:12:16,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:12:16,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:12:16,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:12:16,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:12:16,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:12:16,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:12:16,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:12:16,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:12:16,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:12:16,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:12:16,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:12:16,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:12:16,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:12:16,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:12:16,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:12:16,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:12:16,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:12:16,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:12:16,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:12:16,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:12:16,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:12:16,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:12:16,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:12:16,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:12:16,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:12:16,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:12:16,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:12:16,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:12:16,352 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:12:16,352 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:12:16,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:12:16,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:12:16,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-17 14:12:16,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:12:16,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:12:16,378 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:12:16,379 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:12:16,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:12:16,379 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:12:16,380 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:12:16,380 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-17 14:12:16,380 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:12:16,380 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-17 14:12:16,380 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-17 14:12:16,381 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:12:16,381 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:12:16,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:12:16,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:12:16,382 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:12:16,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:12:16,386 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:12:16,386 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:12:16,386 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:12:16,386 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:12:16,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:12:16,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:12:16,387 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:12:16,387 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:12:16,387 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:12:16,387 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:12:16,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:12:16,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:12:16,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:12:16,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:12:16,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:12:16,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:12:16,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:12:16,389 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:12:16,390 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:12:16,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:12:16,390 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:12:16,390 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:12:16,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:12:16,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:12:16,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:12:16,471 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:12:16,472 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:12:16,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-12-17 14:12:16,473 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-12-17 14:12:16,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:12:16,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:12:16,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:16,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:12:16,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:12:16,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:16,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:12:16,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:12:16,587 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:12:16,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:12:16,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:12:16,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:12:16,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:12:16,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (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-17 14:12:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-17 14:12:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-17 14:12:17,290 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-17 14:12:17,291 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-17 14:12:17,291 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:17 BoogieIcfgContainer [2018-12-17 14:12:17,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:12:17,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:12:17,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:12:17,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:12:17,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/2) ... [2018-12-17 14:12:17,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5c5eed and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:17, skipping insertion in model container [2018-12-17 14:12:17,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:17" (2/2) ... [2018-12-17 14:12:17,299 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-12-17 14:12:17,308 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:12:17,317 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-17 14:12:17,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-17 14:12:17,369 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:12:17,370 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:12:17,370 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:12:17,370 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:12:17,370 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:12:17,370 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:12:17,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:12:17,371 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:12:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-17 14:12:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-17 14:12:17,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:17,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-17 14:12:17,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-17 14:12:17,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:17,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:17,605 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {11#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-17 14:12:17,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= 4 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {10#false} is VALID [2018-12-17 14:12:17,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2018-12-17 14:12:17,617 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2018-12-17 14:12:17,619 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-17 14:12:17,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:17,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-17 14:12:17,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:17,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:17,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:17,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:17,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:17,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:17,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:17,693 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-17 14:12:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:17,790 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-17 14:12:17,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:17,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-17 14:12:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-17 14:12:17,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2018-12-17 14:12:17,919 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-17 14:12:17,930 INFO L225 Difference]: With dead ends: 11 [2018-12-17 14:12:17,930 INFO L226 Difference]: Without dead ends: 7 [2018-12-17 14:12:17,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 14:12:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-17 14:12:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-17 14:12:18,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:18,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:18,044 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:18,044 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,046 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-17 14:12:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-17 14:12:18,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:18,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:18,048 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:18,048 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,050 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-17 14:12:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-17 14:12:18,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:18,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:18,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:18,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-17 14:12:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-17 14:12:18,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-17 14:12:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:18,058 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-17 14:12:18,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:12:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-17 14:12:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-17 14:12:18,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:18,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-17 14:12:18,059 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2018-12-17 14:12:18,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:18,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:18,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:18,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:18,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:18,358 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {61#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-17 14:12:18,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {62#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-17 14:12:18,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {60#false} is VALID [2018-12-17 14:12:18,365 INFO L273 TraceCheckUtils]: 3: Hoare triple {60#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {60#false} is VALID [2018-12-17 14:12:18,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-12-17 14:12:18,366 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-17 14:12:18,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:12:18,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:12:18,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-17 14:12:18,370 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2018-12-17 14:12:18,410 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-17 14:12:18,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:12:18,674 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-17 14:12:18,676 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-17 14:12:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:18,683 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-17 14:12:18,884 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-17 14:12:18,902 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-17 14:12:18,940 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-17 14:12:18,975 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-17 14:12:18,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-17 14:12:18,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-17 14:12:18,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:18,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-17 14:12:18,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:18,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-17 14:12:19,002 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-17 14:12:19,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-17 14:12:19,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-17 14:12:19,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-17 14:12:19,003 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-17 14:12:19,642 WARN L207 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-17 14:12:19,642 WARN L212 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-17 14:12:19,643 WARN L214 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-17 14:12:19,644 WARN L218 ngHoareTripleChecker]: -- [2018-12-17 14:12:19,645 WARN L219 ngHoareTripleChecker]: Pre: {103#true} [2018-12-17 14:12:19,645 WARN L223 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-17 14:12:19,646 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-17 14:12:19,646 WARN L225 ngHoareTripleChecker]: Post: {104#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-17 14:12:19,646 WARN L235 ngHoareTripleChecker]: -- [2018-12-17 14:12:19,647 WARN L237 ngHoareTripleChecker]: unsat core generation is disabled, enable it to get more details [2018-12-17 14:12:19,648 FATAL L613 ntHoareTripleChecker]: Check was UNKNOWN but should have been INVALID [2018-12-17 14:12:19,648 FATAL L616 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-17 14:12:19,649 FATAL L621 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-17 14:12:19,649 FATAL L622 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-17 14:12:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-17 14:12:19,651 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Invalid hoare triple check at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) [2018-12-17 14:12:19,655 INFO L168 Benchmark]: Toolchain (without parser) took 3112.00 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:19,657 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-17 14:12:19,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.98 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-17 14:12:19,658 INFO L168 Benchmark]: Boogie Preprocessor took 25.64 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-17 14:12:19,659 INFO L168 Benchmark]: RCFGBuilder took 678.99 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-17 14:12:19,660 INFO L168 Benchmark]: TraceAbstraction took 2360.87 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:19,664 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.25 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 41.98 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 25.64 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 678.99 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 2360.87 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Invalid hoare triple check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Invalid hoare triple check: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:254) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...