java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e4dfe74 [2018-12-18 17:52:22,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 17:52:22,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 17:52:22,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 17:52:22,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 17:52:22,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 17:52:22,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 17:52:22,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 17:52:22,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 17:52:22,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 17:52:22,441 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 17:52:22,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 17:52:22,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 17:52:22,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 17:52:22,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 17:52:22,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 17:52:22,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 17:52:22,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 17:52:22,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 17:52:22,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 17:52:22,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 17:52:22,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 17:52:22,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 17:52:22,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 17:52:22,467 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 17:52:22,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 17:52:22,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 17:52:22,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 17:52:22,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 17:52:22,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 17:52:22,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 17:52:22,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 17:52:22,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 17:52:22,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 17:52:22,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 17:52:22,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 17:52:22,482 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-18 17:52:22,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 17:52:22,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 17:52:22,509 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 17:52:22,509 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 17:52:22,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 17:52:22,509 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 17:52:22,509 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 17:52:22,510 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 17:52:22,510 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 17:52:22,510 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 17:52:22,510 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 17:52:22,510 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 17:52:22,511 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 17:52:22,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 17:52:22,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 17:52:22,512 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 17:52:22,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 17:52:22,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 17:52:22,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 17:52:22,513 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 17:52:22,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 17:52:22,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 17:52:22,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 17:52:22,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 17:52:22,514 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 17:52:22,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 17:52:22,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 17:52:22,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 17:52:22,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 17:52:22,515 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 17:52:22,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 17:52:22,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 17:52:22,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 17:52:22,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 17:52:22,516 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 17:52:22,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 17:52:22,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 17:52:22,516 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 17:52:22,516 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 17:52:22,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 17:52:22,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 17:52:22,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 17:52:22,567 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 17:52:22,567 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 17:52:22,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-12-18 17:52:22,569 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-12-18 17:52:22,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 17:52:22,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 17:52:22,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 17:52:22,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 17:52:22,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 17:52:22,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 17:52:22,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 17:52:22,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 17:52:22,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 17:52:22,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/1) ... [2018-12-18 17:52:22,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 17:52:22,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 17:52:22,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 17:52:22,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 17:52:22,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (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-18 17:52:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 17:52:22,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 17:52:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-18 17:52:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-18 17:52:23,375 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 17:52:23,376 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-18 17:52:23,376 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:52:23 BoogieIcfgContainer [2018-12-18 17:52:23,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 17:52:23,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 17:52:23,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 17:52:23,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 17:52:23,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 05:52:22" (1/2) ... [2018-12-18 17:52:23,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8a05d and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:52:23, skipping insertion in model container [2018-12-18 17:52:23,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:52:23" (2/2) ... [2018-12-18 17:52:23,385 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-12-18 17:52:23,396 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 17:52:23,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-18 17:52:23,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-18 17:52:23,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 17:52:23,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 17:52:23,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 17:52:23,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 17:52:23,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 17:52:23,449 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 17:52:23,449 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 17:52:23,449 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 17:52:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-12-18 17:52:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-18 17:52:23,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:23,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-18 17:52:23,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-18 17:52:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2018-12-18 17:52:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:23,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:23,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:23,703 INFO L273 TraceCheckUtils]: 0: Hoare triple {16#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {16#true} is VALID [2018-12-18 17:52:23,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc(400);main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} is VALID [2018-12-18 17:52:23,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} is VALID [2018-12-18 17:52:23,714 INFO L273 TraceCheckUtils]: 3: Hoare triple {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} assume main_#t~short2; {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} is VALID [2018-12-18 17:52:23,716 INFO L273 TraceCheckUtils]: 4: Hoare triple {18#(select |#valid| ULTIMATE.start_main_~q~1.base)} assume !#valid[main_~q~1.base]; {17#false} is VALID [2018-12-18 17:52:23,718 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-18 17:52:23,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 17:52:23,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-18 17:52:23,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 17:52:23,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-18 17:52:23,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:23,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 17:52:23,772 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-18 17:52:23,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 17:52:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 17:52:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:23,783 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2018-12-18 17:52:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:23,897 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-18 17:52:23,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 17:52:23,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-18 17:52:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:23,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-18 17:52:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-18 17:52:23,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2018-12-18 17:52:24,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:24,088 INFO L225 Difference]: With dead ends: 17 [2018-12-18 17:52:24,089 INFO L226 Difference]: Without dead ends: 8 [2018-12-18 17:52:24,092 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-18 17:52:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-18 17:52:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-18 17:52:24,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:24,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:24,120 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:24,120 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,123 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-12-18 17:52:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-18 17:52:24,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:24,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:24,124 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:24,124 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-18 17:52:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,126 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-12-18 17:52:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-18 17:52:24,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:24,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:24,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:24,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 17:52:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-18 17:52:24,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-18 17:52:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:24,131 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-18 17:52:24,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 17:52:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-18 17:52:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-18 17:52:24,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:24,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-18 17:52:24,133 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-18 17:52:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash 28694790, now seen corresponding path program 1 times [2018-12-18 17:52:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:24,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:24,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:24,316 INFO L273 TraceCheckUtils]: 0: Hoare triple {66#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {66#true} is VALID [2018-12-18 17:52:24,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {66#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc(400);main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {68#(and (= (select |#length| ULTIMATE.start_main_~q~1.base) 400) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-18 17:52:24,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#(and (= (select |#length| ULTIMATE.start_main_~q~1.base) 400) (= ULTIMATE.start_main_~q~1.offset 0))} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {68#(and (= (select |#length| ULTIMATE.start_main_~q~1.base) 400) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-18 17:52:24,357 INFO L273 TraceCheckUtils]: 3: Hoare triple {68#(and (= (select |#length| ULTIMATE.start_main_~q~1.base) 400) (= ULTIMATE.start_main_~q~1.offset 0))} assume main_#t~short2; {68#(and (= (select |#length| ULTIMATE.start_main_~q~1.base) 400) (= ULTIMATE.start_main_~q~1.offset 0))} is VALID [2018-12-18 17:52:24,373 INFO L273 TraceCheckUtils]: 4: Hoare triple {68#(and (= (select |#length| ULTIMATE.start_main_~q~1.base) 400) (= ULTIMATE.start_main_~q~1.offset 0))} assume !(4 + main_~q~1.offset <= #length[main_~q~1.base]); {67#false} is VALID [2018-12-18 17:52:24,374 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-18 17:52:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 17:52:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-18 17:52:24,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 17:52:24,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-18 17:52:24,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:24,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 17:52:24,402 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-18 17:52:24,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 17:52:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 17:52:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:24,404 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2018-12-18 17:52:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,490 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-18 17:52:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 17:52:24,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-18 17:52:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-18 17:52:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-18 17:52:24,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2018-12-18 17:52:24,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:24,567 INFO L225 Difference]: With dead ends: 14 [2018-12-18 17:52:24,567 INFO L226 Difference]: Without dead ends: 13 [2018-12-18 17:52:24,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-18 17:52:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-18 17:52:24,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:24,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 11 states. [2018-12-18 17:52:24,611 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 11 states. [2018-12-18 17:52:24,612 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 11 states. [2018-12-18 17:52:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,614 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-18 17:52:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-18 17:52:24,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:24,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:24,615 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 13 states. [2018-12-18 17:52:24,615 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 13 states. [2018-12-18 17:52:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,617 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-18 17:52:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-18 17:52:24,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:24,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:24,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:24,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-18 17:52:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-18 17:52:24,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-12-18 17:52:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:24,621 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-18 17:52:24,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 17:52:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-18 17:52:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-18 17:52:24,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:24,622 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-18 17:52:24,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-18 17:52:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash 153812288, now seen corresponding path program 1 times [2018-12-18 17:52:24,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:24,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:24,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:24,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:24,690 INFO L273 TraceCheckUtils]: 0: Hoare triple {126#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {126#true} is VALID [2018-12-18 17:52:24,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {126#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc(400);main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {126#true} is VALID [2018-12-18 17:52:24,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {126#true} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {126#true} is VALID [2018-12-18 17:52:24,692 INFO L273 TraceCheckUtils]: 3: Hoare triple {126#true} assume !main_#t~short2; {128#(not |ULTIMATE.start_main_#t~short2|)} is VALID [2018-12-18 17:52:24,694 INFO L273 TraceCheckUtils]: 4: Hoare triple {128#(not |ULTIMATE.start_main_#t~short2|)} assume !!main_#t~short2;havoc main_#t~mem1;havoc main_#t~short2;main_#t~post3.base, main_#t~post3.offset := main_~q~1.base, main_~q~1.offset;main_~q~1.base, main_~q~1.offset := main_#t~post3.base, main_#t~post3.offset + 4;havoc main_#t~post3.base, main_#t~post3.offset; {127#false} is VALID [2018-12-18 17:52:24,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {127#false} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {127#false} is VALID [2018-12-18 17:52:24,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#false} assume main_#t~short2; {127#false} is VALID [2018-12-18 17:52:24,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#false} assume !(4 + main_~q~1.offset <= #length[main_~q~1.base]); {127#false} is VALID [2018-12-18 17:52:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:24,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 17:52:24,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-18 17:52:24,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 17:52:24,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-18 17:52:24,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 17:52:24,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 17:52:24,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 17:52:24,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 17:52:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 17:52:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:24,718 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-12-18 17:52:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,862 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-18 17:52:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 17:52:24,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-18 17:52:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 17:52:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-18 17:52:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 17:52:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-18 17:52:24,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2018-12-18 17:52:24,914 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-18 17:52:24,915 INFO L225 Difference]: With dead ends: 18 [2018-12-18 17:52:24,916 INFO L226 Difference]: Without dead ends: 11 [2018-12-18 17:52:24,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 17:52:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-18 17:52:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-18 17:52:24,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 17:52:24,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2018-12-18 17:52:24,925 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-18 17:52:24,925 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-18 17:52:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,926 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-18 17:52:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-18 17:52:24,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:24,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:24,927 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-18 17:52:24,928 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-18 17:52:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 17:52:24,929 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-18 17:52:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-18 17:52:24,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 17:52:24,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 17:52:24,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 17:52:24,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 17:52:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-18 17:52:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-18 17:52:24,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-12-18 17:52:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 17:52:24,932 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-18 17:52:24,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 17:52:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-18 17:52:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-18 17:52:24,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 17:52:24,933 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-18 17:52:24,933 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-18 17:52:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 17:52:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 446561917, now seen corresponding path program 1 times [2018-12-18 17:52:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 17:52:24,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:24,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 17:52:24,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 17:52:24,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 17:52:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 17:52:25,174 INFO L273 TraceCheckUtils]: 0: Hoare triple {187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := false]; {187#true} is VALID [2018-12-18 17:52:25,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {187#true} havoc main_main;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~post3.base, main_#t~post3.offset, main_#t~mem1, main_#t~short2, main_~p~1.base, main_~p~1.offset, main_~q~1.base, main_~q~1.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := ~malloc(400);main_~p~1.base, main_~p~1.offset := main_#t~malloc0.base, main_#t~malloc0.offset;main_~q~1.base, main_~q~1.offset := main_~p~1.base, main_~p~1.offset; {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} is VALID [2018-12-18 17:52:25,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} is VALID [2018-12-18 17:52:25,177 INFO L273 TraceCheckUtils]: 3: Hoare triple {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} assume main_#t~short2; {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} is VALID [2018-12-18 17:52:25,181 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} SUMMARY for call main_#t~mem1 := read~int(main_~q~1.base, main_~q~1.offset, 4); srcloc: L16 {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} is VALID [2018-12-18 17:52:25,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} main_#t~short2 := main_#t~mem1 >= 0; {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} is VALID [2018-12-18 17:52:25,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#(and (= ULTIMATE.start_main_~q~1.offset 0) (= 400 (select |#length| ULTIMATE.start_main_~q~1.base)))} assume !!main_#t~short2;havoc main_#t~mem1;havoc main_#t~short2;main_#t~post3.base, main_#t~post3.offset := main_~q~1.base, main_~q~1.offset;main_~q~1.base, main_~q~1.offset := main_#t~post3.base, main_#t~post3.offset + 4;havoc main_#t~post3.base, main_#t~post3.offset; {190#(and (<= ULTIMATE.start_main_~q~1.offset 4) (= (select |#length| ULTIMATE.start_main_~q~1.base) 400))} is VALID [2018-12-18 17:52:25,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#(and (<= ULTIMATE.start_main_~q~1.offset 4) (= (select |#length| ULTIMATE.start_main_~q~1.base) 400))} main_#t~short2 := main_~q~1.offset < main_~p~1.offset + 400; {190#(and (<= ULTIMATE.start_main_~q~1.offset 4) (= (select |#length| ULTIMATE.start_main_~q~1.base) 400))} is VALID [2018-12-18 17:52:25,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#(and (<= ULTIMATE.start_main_~q~1.offset 4) (= (select |#length| ULTIMATE.start_main_~q~1.base) 400))} assume main_#t~short2; {190#(and (<= ULTIMATE.start_main_~q~1.offset 4) (= (select |#length| ULTIMATE.start_main_~q~1.base) 400))} is VALID [2018-12-18 17:52:25,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#(and (<= ULTIMATE.start_main_~q~1.offset 4) (= (select |#length| ULTIMATE.start_main_~q~1.base) 400))} assume !(4 + main_~q~1.offset <= #length[main_~q~1.base]); {188#false} is VALID [2018-12-18 17:52:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 17:52:25,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 17:52:25,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 17:52:25,189 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-18 17:52:25,191 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [10], [12], [13], [21] [2018-12-18 17:52:25,231 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 17:52:25,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 17:52:25,325 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:425) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:416) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) 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) 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) [2018-12-18 17:52:25,333 INFO L168 Benchmark]: Toolchain (without parser) took 2697.98 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: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2018-12-18 17:52:25,335 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-18 17:52:25,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.03 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-18 17:52:25,336 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 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-18 17:52:25,337 INFO L168 Benchmark]: RCFGBuilder took 651.87 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-18 17:52:25,341 INFO L168 Benchmark]: TraceAbstraction took 1953.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-12-18 17:52:25,348 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.22 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 59.03 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 28.10 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 651.87 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 1953.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:140) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...