java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 14:41:14,947 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 14:41:14,949 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 14:41:14,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 14:41:14,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 14:41:14,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 14:41:14,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 14:41:14,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 14:41:14,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 14:41:14,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 14:41:14,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 14:41:14,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 14:41:14,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 14:41:14,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 14:41:14,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 14:41:14,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 14:41:14,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 14:41:14,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 14:41:14,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 14:41:14,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 14:41:15,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 14:41:15,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 14:41:15,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 14:41:15,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 14:41:15,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 14:41:15,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 14:41:15,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 14:41:15,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 14:41:15,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 14:41:15,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 14:41:15,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 14:41:15,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 14:41:15,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 14:41:15,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 14:41:15,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 14:41:15,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 14:41:15,011 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 14:41:15,024 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 14:41:15,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 14:41:15,025 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 14:41:15,025 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 14:41:15,025 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 14:41:15,026 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 14:41:15,026 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 14:41:15,026 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 14:41:15,026 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 14:41:15,027 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 14:41:15,027 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 14:41:15,027 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 14:41:15,027 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 14:41:15,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 14:41:15,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 14:41:15,028 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 14:41:15,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 14:41:15,029 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 14:41:15,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 14:41:15,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 14:41:15,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 14:41:15,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 14:41:15,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 14:41:15,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 14:41:15,030 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 14:41:15,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 14:41:15,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 14:41:15,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 14:41:15,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 14:41:15,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 14:41:15,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:41:15,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 14:41:15,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 14:41:15,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 14:41:15,032 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 14:41:15,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 14:41:15,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 14:41:15,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 14:41:15,033 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 14:41:15,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 14:41:15,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 14:41:15,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 14:41:15,102 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 14:41:15,102 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 14:41:15,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-18 14:41:15,105 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-18 14:41:15,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 14:41:15,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 14:41:15,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 14:41:15,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 14:41:15,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 14:41:15,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,194 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-18 14:41:15,195 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-18 14:41:15,195 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-18 14:41:15,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 14:41:15,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 14:41:15,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 14:41:15,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 14:41:15,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/1) ... [2019-01-18 14:41:15,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 14:41:15,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 14:41:15,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 14:41:15,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 14:41:15,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (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 [2019-01-18 14:41:15,298 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-18 14:41:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-18 14:41:15,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-18 14:41:15,546 INFO L278 CfgBuilder]: Using library mode [2019-01-18 14:41:15,547 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-18 14:41:15,550 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:41:15 BoogieIcfgContainer [2019-01-18 14:41:15,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 14:41:15,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 14:41:15,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 14:41:15,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 14:41:15,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 02:41:15" (1/2) ... [2019-01-18 14:41:15,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f77c4b and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:41:15, skipping insertion in model container [2019-01-18 14:41:15,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:41:15" (2/2) ... [2019-01-18 14:41:15,567 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-18 14:41:15,589 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 14:41:15,609 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 14:41:15,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 14:41:15,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 14:41:15,687 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 14:41:15,687 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 14:41:15,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 14:41:15,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 14:41:15,688 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 14:41:15,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 14:41:15,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 14:41:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 14:41:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:41:15,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:41:15,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:41:15,714 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:41:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:41:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-18 14:41:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:41:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:41:15,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:41:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:41:15,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:41:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:41:15,931 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-01-18 14:41:15,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-01-18 14:41:15,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-01-18 14:41:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:41:15,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:41:15,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 14:41:15,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:41:15,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 14:41:15,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:41:15,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-18 14:41:15,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:41:15,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 14:41:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 14:41:16,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:41:16,004 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-18 14:41:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:41:16,131 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-18 14:41:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:41:16,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 14:41:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:41:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:41:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-18 14:41:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:41:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-18 14:41:16,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-18 14:41:16,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:41:16,220 INFO L225 Difference]: With dead ends: 11 [2019-01-18 14:41:16,221 INFO L226 Difference]: Without dead ends: 5 [2019-01-18 14:41:16,224 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 [2019-01-18 14:41:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-18 14:41:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-18 14:41:16,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:41:16,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-18 14:41:16,267 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-18 14:41:16,267 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-18 14:41:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:41:16,269 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:41:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:41:16,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:41:16,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:41:16,270 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-18 14:41:16,270 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-18 14:41:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:41:16,271 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:41:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:41:16,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:41:16,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:41:16,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:41:16,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:41:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-18 14:41:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-18 14:41:16,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-18 14:41:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:41:16,276 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-18 14:41:16,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 14:41:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 14:41:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:41:16,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:41:16,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:41:16,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:41:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:41:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-18 14:41:16,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:41:16,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:41:16,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:41:16,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:41:16,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:41:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:41:16,784 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-18 14:41:16,791 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-01-18 14:41:16,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {47#(and (<= i 1) (= 0 (select a 0)))} is VALID [2019-01-18 14:41:16,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(and (<= i 1) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {48#(and (= r 0) (= 0 (select a r)))} is VALID [2019-01-18 14:41:16,804 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-01-18 14:41:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:41:16,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:41:16,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:41:16,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:41:16,808 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-18 14:41:16,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 14:41:16,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:41:38,759 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 14:41:38,760 INFO L272 AbstractInterpreter]: Visited 4 different actions 15 times. Merged at 2 different actions 7 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:41:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:41:38,765 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 14:41:40,659 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 42.22% of their original sizes. [2019-01-18 14:41:40,705 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 14:41:42,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_259 Int) (v_idx_261 Int) (v_idx_260 Int)) (exists ((v_b_28_1 Int) (v_v_382_1 Int) (v_v_384_1 Int)) (and (or (< v_idx_261 v_b_28_1) (= (select c_a v_idx_261) v_v_384_1)) (<= 0 (* 2 c_r)) (<= 1 v_b_28_1) (or (<= 0 v_idx_259) (= (select c_a v_idx_259) v_v_382_1)) (<= 0 c_r) (<= 1 (+ v_b_28_1 c_r)) (or (= (select c_a v_idx_260) 0) (<= v_b_28_1 v_idx_260) (< v_idx_260 0)) (<= 2 (* 2 v_b_28_1)) (<= (+ c_r 1) v_b_28_1)))) is different from false [2019-01-18 14:41:43,139 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-18 14:41:43,490 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 14:41:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 14:41:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-18 14:41:43,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:41:43,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 14:41:43,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:41:43,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-18 14:41:43,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:41:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 14:41:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 14:41:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-01-18 14:41:43,518 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-18 14:41:47,898 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-18 14:41:47,898 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-18 14:41:47,899 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-18 14:41:47,900 WARN L223 ngHoareTripleChecker]: -- [2019-01-18 14:41:47,900 WARN L224 ngHoareTripleChecker]: Pre: {91#(forall ((v_idx_311 Int) (v_idx_308 Int) (v_idx_309 Int) (v_idx_310 Int)) (exists ((v_v_738_1 Int) (v_v_382_1 Int) (v_v_384_1 Int)) (and (or (= (select c_a v_idx_309) 0) (<= c_i v_idx_309) (< v_idx_309 0)) (<= 0 c_i) (or (= v_v_382_1 (select c_a v_idx_308)) (<= 0 v_idx_308)) (<= 0 (* 2 c_i)) (<= (- (- c_i) c_i) 0) (= v_v_738_1 (select |c_old(a)| v_idx_311)) (or (= v_v_384_1 (select c_a v_idx_310)) (< v_idx_310 c_i)))))} [2019-01-18 14:41:47,900 WARN L228 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-01-18 14:41:47,901 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-01-18 14:41:47,901 WARN L230 ngHoareTripleChecker]: Post: {92#false} [2019-01-18 14:41:47,901 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-18 14:41:47,905 WARN L268 ngHoareTripleChecker]: -- [2019-01-18 14:41:47,906 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-18 14:41:48,056 WARN L270 ngHoareTripleChecker]: Pre: {91#(and (<= 0 i) (forall ((v_idx_309 Int)) (or (= (select a v_idx_309) 0) (<= i v_idx_309) (< v_idx_309 0))) (<= 0 (* 2 i)) (<= (- (- i) i) 0))} [2019-01-18 14:41:48,056 WARN L274 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-01-18 14:41:48,057 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-01-18 14:41:48,063 WARN L276 ngHoareTripleChecker]: Post: {92#false} [2019-01-18 14:41:48,063 WARN L620 ntHoareTripleChecker]: -- [2019-01-18 14:41:48,064 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-18 14:41:48,064 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_382 [b_27] v_383 [b_28] v_384 [inf_0], [old(a)] -> [-inf_0] v_738 [inf_0], }, Substate: {ints: {v_383 = [0; 0]; b_28 = [0; inf]; i = [0; inf]; b_27 = [0; 0]}, 10 vars top, relations: {b_28 + v_383 = [0; inf]; b_28 - v_383 = [0; inf]; i + v_383 = [0; inf]; i - v_383 = [0; inf]; b_27 + v_383 = [0; 0]; b_27 - v_383 = [0; 0]; b_27 + b_28 = [0; inf]; b_27 - b_28 = [-inf; 0]; b_28 + i = [0; inf]; b_28 - i = [0; 0]; b_27 + i = [0; inf]; b_27 - i = [-inf; 0]}, }}} [2019-01-18 14:41:48,064 WARN L628 ntHoareTripleChecker]: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) (assume !(i < n);assume 0 <= r && r < n;) [2019-01-18 14:41:48,065 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-18 14:41:48,065 WARN L630 ntHoareTripleChecker]: -- [2019-01-18 14:41:50,138 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_259 Int) (v_idx_261 Int) (v_idx_260 Int)) (exists ((v_b_28_1 Int) (v_v_382_1 Int) (v_v_384_1 Int)) (and (or (< v_idx_261 v_b_28_1) (= (select c_a v_idx_261) v_v_384_1)) (<= 0 (* 2 c_r)) (<= 1 v_b_28_1) (or (<= 0 v_idx_259) (= (select c_a v_idx_259) v_v_382_1)) (<= 0 c_r) (<= 1 (+ v_b_28_1 c_r)) (or (= (select c_a v_idx_260) 0) (<= v_b_28_1 v_idx_260) (< v_idx_260 0)) (<= 2 (* 2 v_b_28_1)) (<= (+ c_r 1) v_b_28_1)))) (forall ((v_idx_250 Int) (v_idx_251 Int) (v_idx_252 Int)) (exists ((v_v_382_1 Int) (v_v_384_1 Int)) (and (<= 0 c_i) (<= 0 (* 2 c_i)) (or (<= 0 v_idx_250) (= (select c_a v_idx_250) v_v_382_1)) (or (= (select c_a v_idx_252) v_v_384_1) (< v_idx_252 c_i)) (or (< v_idx_251 0) (<= c_i v_idx_251) (= (select c_a v_idx_251) 0)))))) is different from false [2019-01-18 14:41:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:41:52,775 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-18 14:41:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:41:52,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 14:41:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:41:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:41:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-18 14:41:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:41:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-18 14:41:52,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-01-18 14:41:52,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:41:52,932 INFO L225 Difference]: With dead ends: 5 [2019-01-18 14:41:52,932 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 14:41:52,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-01-18 14:41:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 14:41:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 14:41:52,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:41:52,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-18 14:41:52,935 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 14:41:52,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 14:41:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:41:52,936 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 14:41:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:41:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:41:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:41:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 14:41:52,937 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 14:41:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:41:52,937 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 14:41:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:41:52,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:41:52,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:41:52,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:41:52,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:41:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 14:41:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 14:41:52,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-18 14:41:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:41:52,939 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 14:41:52,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 14:41:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:41:52,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:41:52,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 14:41:52,984 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 23 35) no Hoare annotation was computed. [2019-01-18 14:41:52,984 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2019-01-18 14:41:52,985 INFO L444 ceAbstractionStarter]: At program point L29-1(lines 29 32) the Hoare annotation is: (forall ((v_idx_250 Int) (v_idx_251 Int) (v_idx_252 Int)) (exists ((v_v_382_1 Int) (v_v_384_1 Int)) (and (<= 0 i) (<= 0 (* 2 i)) (or (<= 0 v_idx_250) (= (select a v_idx_250) v_v_382_1)) (or (= (select a v_idx_252) v_v_384_1) (< v_idx_252 i)) (or (< v_idx_251 0) (<= i v_idx_251) (= (select a v_idx_251) 0))))) [2019-01-18 14:41:52,985 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2019-01-18 14:41:52,985 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-01-18 14:41:52,985 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-18 14:41:52,986 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-18 14:41:52,993 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-01-18 14:41:52,994 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-01-18 14:41:52,994 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-01-18 14:41:52,994 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-18 14:41:52,994 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-18 14:41:53,002 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 02:41:53 BoogieIcfgContainer [2019-01-18 14:41:53,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 14:41:53,004 INFO L168 Benchmark]: Toolchain (without parser) took 37852.10 ms. Allocated memory was 133.7 MB in the beginning and 508.0 MB in the end (delta: 374.3 MB). Free memory was 109.0 MB in the beginning and 105.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 377.8 MB. Max. memory is 7.1 GB. [2019-01-18 14:41:53,006 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 14:41:53,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.00 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 106.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-18 14:41:53,008 INFO L168 Benchmark]: Boogie Preprocessor took 29.65 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.0 MB in the end (delta: 969.3 kB). Peak memory consumption was 969.3 kB. Max. memory is 7.1 GB. [2019-01-18 14:41:53,009 INFO L168 Benchmark]: RCFGBuilder took 322.16 ms. Allocated memory is still 133.7 MB. Free memory was 105.8 MB in the beginning and 95.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-18 14:41:53,010 INFO L168 Benchmark]: TraceAbstraction took 37451.61 ms. Allocated memory was 133.7 MB in the beginning and 508.0 MB in the end (delta: 374.3 MB). Free memory was 95.6 MB in the beginning and 105.6 MB in the end (delta: -10.0 MB). Peak memory consumption was 364.3 MB. Max. memory is 7.1 GB. [2019-01-18 14:41:53,017 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 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.00 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 106.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.65 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.0 MB in the end (delta: 969.3 kB). Peak memory consumption was 969.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 322.16 ms. Allocated memory is still 133.7 MB. Free memory was 105.8 MB in the beginning and 95.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37451.61 ms. Allocated memory was 133.7 MB in the beginning and 508.0 MB in the end (delta: 374.3 MB). Free memory was 95.6 MB in the beginning and 105.6 MB in the end (delta: -10.0 MB). Peak memory consumption was 364.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (forall v_idx_250 : int, v_idx_251 : int, v_idx_252 : int :: (exists v_v_382_1 : int, v_v_384_1 : int :: (((0 <= i && 0 <= 2 * i) && (0 <= v_idx_250 || a[v_idx_250] == v_v_382_1)) && (a[v_idx_252] == v_v_384_1 || v_idx_252 < i)) && ((v_idx_251 < 0 || i <= v_idx_251) || a[v_idx_251] == 0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 37.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 4 SDs, 0 SdLazy, 3 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 21.9s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 41 HoareAnnotationTreeSize, 1 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...