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-a9d37a5-m [2019-02-28 13:38:31,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:38:31,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:38:31,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:38:31,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:38:31,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:38:31,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:38:31,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:38:31,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:38:31,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:38:31,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:38:31,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:38:31,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:38:31,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:38:31,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:38:31,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:38:31,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:38:31,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:38:31,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:38:31,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:38:31,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:38:31,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:38:31,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:38:31,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:38:31,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:38:31,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:38:31,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:38:31,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:38:31,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:38:31,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:38:31,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:38:31,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:38:31,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:38:31,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:38:31,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:38:31,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:38:31,089 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-02-28 13:38:31,116 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:38:31,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:38:31,117 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:38:31,118 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:38:31,120 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:38:31,121 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:38:31,121 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:38:31,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:38:31,121 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:38:31,122 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:38:31,122 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:38:31,122 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:38:31,122 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:38:31,124 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:38:31,124 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:38:31,124 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:38:31,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:38:31,125 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:38:31,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:38:31,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:38:31,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:38:31,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:38:31,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:38:31,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:38:31,127 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:38:31,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:38:31,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:38:31,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:38:31,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:38:31,129 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:38:31,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:38:31,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:38:31,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:38:31,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:38:31,130 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:38:31,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:38:31,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:38:31,131 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:38:31,131 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:38:31,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:38:31,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:38:31,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:38:31,195 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:38:31,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:38:31,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-02-28 13:38:31,197 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-02-28 13:38:31,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:38:31,234 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:38:31,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:38:31,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:38:31,235 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:38:31,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,269 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:38:31,269 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:38:31,270 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:38:31,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:38:31,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:38:31,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:38:31,273 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:38:31,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/1) ... [2019-02-28 13:38:31,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:38:31,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:38:31,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:38:31,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:38:31,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:38:31,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 13:38:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 13:38:31,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 13:38:31,589 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:38:31,590 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-28 13:38:31,591 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:38:31 BoogieIcfgContainer [2019-02-28 13:38:31,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:38:31,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:38:31,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:38:31,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:38:31,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:38:31" (1/2) ... [2019-02-28 13:38:31,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5199f6c7 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:38:31, skipping insertion in model container [2019-02-28 13:38:31,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:38:31" (2/2) ... [2019-02-28 13:38:31,599 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-02-28 13:38:31,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:38:31,617 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:38:31,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:38:31,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:38:31,707 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:38:31,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:38:31,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:38:31,708 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:38:31,708 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:38:31,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:38:31,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:38:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:38:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:38:31,745 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:38:31,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:38:31,748 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:38:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:38:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-28 13:38:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:38:31,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:38:31,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:38:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:38:31,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:38:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:38:31,959 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-02-28 13:38:31,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-02-28 13:38:31,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-02-28 13:38:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:38:31,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:38:31,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:38:31,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:38:31,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:38:31,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:38:31,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:38:31,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:38:31,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:38:32,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:38:32,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:38:32,005 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 13:38:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:38:32,110 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 13:38:32,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:38:32,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:38:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:38:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:38:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-28 13:38:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:38:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-28 13:38:32,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-02-28 13:38:32,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:38:32,162 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:38:32,162 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:38:32,165 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-02-28 13:38:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:38:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:38:32,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:38:32,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:38:32,230 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:38:32,231 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:38:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:38:32,232 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:38:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:38:32,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:38:32,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:38:32,234 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:38:32,234 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:38:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:38:32,235 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:38:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:38:32,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:38:32,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:38:32,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:38:32,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:38:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:38:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:38:32,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:38:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:38:32,240 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:38:32,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:38:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:38:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:38:32,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:38:32,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:38:32,242 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:38:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:38:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-02-28 13:38:32,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:38:32,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:38:32,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:38:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:38:32,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:38:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:38:32,892 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-02-28 13:38:32,901 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-02-28 13:38:32,902 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-02-28 13:38:32,904 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-02-28 13:38:32,905 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-02-28 13:38:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:38:32,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:38:32,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:38:32,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:38:32,909 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-02-28 13:38:32,962 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:38:32,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:38:50,146 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 13:38:50,148 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-02-28 13:38:50,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:38:50,154 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 13:38:51,241 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 13:38:52,053 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 13:38:52,822 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 13:38:52,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 13:38:52,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-28 13:38:52,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:38:52,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 13:38:52,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:38:52,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:38:52,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:38:52,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:38:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:38:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:38:52,836 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-28 13:38:53,126 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:38:53,127 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:38:53,128 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:38:53,129 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:38:53,129 WARN L224 ngHoareTripleChecker]: Pre: {78#(forall ((v_idx_253 Int)) (and (<= 0 (* 2 c_j)) (<= (- (- c_i) c_j) 0) (<= 0 (* 2 c_i)) (<= 0 (+ c_j c_i)) (<= c_j c_i) (<= (- (- c_i) c_i) 0) (<= (* 2 c_j) 0) (<= (- (- c_j) c_j) 0) (or (< v_idx_253 c_j) (<= c_i v_idx_253) (= (select c_a v_idx_253) c_j)) (<= (- c_j (- c_j)) 0) (<= (- (- c_i) (- c_j)) 0)))} [2019-02-28 13:38:53,130 WARN L228 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-02-28 13:38:53,130 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-02-28 13:38:53,131 WARN L230 ngHoareTripleChecker]: Post: {79#false} [2019-02-28 13:38:53,131 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:38:53,132 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:38:53,132 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:38:53,306 WARN L270 ngHoareTripleChecker]: Pre: {78#(and (<= 0 (* 2 j)) (<= (- (- i) j) 0) (forall ((v_idx_253 Int)) (or (< v_idx_253 j) (<= i v_idx_253) (= (select a v_idx_253) j))) (<= 0 (* 2 i)) (<= 0 (+ j i)) (<= j i) (<= (- (- i) i) 0) (<= (* 2 j) 0) (<= (- (- j) j) 0) (<= (- j (- j)) 0) (<= (- (- i) (- j)) 0))} [2019-02-28 13:38:53,306 WARN L274 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-02-28 13:38:53,307 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-02-28 13:38:53,308 WARN L276 ngHoareTripleChecker]: Post: {79#false} [2019-02-28 13:38:53,309 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:38:53,309 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:38:53,310 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_281 [b_25] v_282 [b_26] v_283 [inf_0], [old(a)] -> [-inf_0] v_633 [inf_0], }, Substate: {ints: {b_26 = [0; inf]; v_282 = [0; 0]; b_25 = [0; 0]; j = [0; 0]; i = [0; inf]}, 9 vars top, relations: {b_25 + b_26 = [0; inf]; b_25 - b_26 = [-inf; 0]; b_26 + v_282 = [0; inf]; b_26 - v_282 = [0; inf]; b_25 + v_282 = [0; 0]; b_25 - v_282 = [0; 0]; j + v_282 = [0; 0]; j - v_282 = [0; 0]; i + v_282 = [0; inf]; i - v_282 = [0; inf]; b_26 + j = [0; inf]; b_26 - j = [0; inf]; b_25 + j = [0; 0]; b_25 - j = [0; 0]; i + j = [0; inf]; i - j = [0; inf]; b_26 + i = [0; inf]; b_26 - i = [0; 0]; b_25 + i = [0; inf]; b_25 - i = [-inf; 0]}, }}} [2019-02-28 13:38:53,311 WARN L628 ntHoareTripleChecker]: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) (assume i < n;a := a[i := 0];i := i + 1;) [2019-02-28 13:38:53,311 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-02-28 13:38:53,311 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:38:55,054 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-02-28 13:38:55,055 WARN L217 ngHoareTripleChecker]: Expected: INVALID Actual: UNKNOWN [2019-02-28 13:38:55,056 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:38:55,056 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:38:55,056 WARN L224 ngHoareTripleChecker]: Pre: {80#(forall ((v_idx_269 Int)) (and (<= 0 (* 2 c_j)) (<= (- (- c_i) c_j) 0) (<= 0 (* 2 c_i)) (<= 0 (+ c_j c_i)) (<= c_j c_i) (<= (- (- c_i) c_i) 0) (<= (* 2 c_j) 0) (<= (- (- c_j) c_j) 0) (or (< v_idx_269 c_j) (<= c_i v_idx_269) (= (select c_a v_idx_269) c_j)) (<= (- c_j (- c_j)) 0) (<= (- (- c_i) (- c_j)) 0)))} [2019-02-28 13:38:55,056 WARN L228 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-02-28 13:38:55,057 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-02-28 13:38:55,057 WARN L230 ngHoareTripleChecker]: Post: {81#(forall ((v_idx_273 Int)) (and (<= 0 (* 2 c_j)) (<= 0 (+ c_j c_r)) (<= (+ c_r 1) c_i) (<= (- (- c_j) c_j) 0) (<= (- c_j (- c_j)) 0) (<= (- (- c_i) c_i) (- 2)) (<= (+ c_j 1) c_i) (<= (- (- c_n) c_n) (- 2)) (<= c_n c_i) (<= c_j c_r) (<= (- (- c_j) c_n) (- 1)) (<= (- c_j c_n) (- 1)) (<= (- (- c_i) c_n) (- 2)) (<= 1 (+ c_j c_i)) (<= 1 (+ c_i c_r)) (or (= c_j (select c_a v_idx_273)) (< v_idx_273 c_j) (<= c_i v_idx_273)) (<= (- c_j c_r) 0) (<= (- (- c_i) (- c_n)) 0) (<= (- (- c_i) (- c_r)) (- 1)) (<= (- (- c_i) c_r) (- 1)) (<= (- (- c_j) c_r) 0) (<= (- (- c_n) c_r) (- 1)) (<= (- (- c_i) c_j) (- 1)) (<= (* 2 c_j) 0) (<= (+ c_j 1) c_n) (<= 2 (* 2 c_i)) (<= (- (- c_i) (- c_j)) (- 1)) (<= (- (- c_r) c_r) 0) (<= 1 (+ c_n c_j)) (<= (- (- c_n) (- c_r)) (- 1)) (<= 2 (+ c_n c_i))))} [2019-02-28 13:38:55,057 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:38:55,058 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:38:55,058 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:38:55,204 WARN L270 ngHoareTripleChecker]: Pre: {80#(and (<= 0 (* 2 j)) (<= (- (- i) j) 0) (<= 0 (* 2 i)) (<= 0 (+ j i)) (<= j i) (<= (- (- i) i) 0) (<= (* 2 j) 0) (<= (- (- j) j) 0) (forall ((v_idx_269 Int)) (or (< v_idx_269 j) (<= i v_idx_269) (= (select a v_idx_269) j))) (<= (- j (- j)) 0) (<= (- (- i) (- j)) 0))} [2019-02-28 13:38:55,204 WARN L274 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-02-28 13:38:55,205 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-02-28 13:38:55,277 WARN L276 ngHoareTripleChecker]: Post: {81#(and (<= 0 (* 2 j)) (<= 0 (+ j r)) (<= (+ r 1) i) (<= (- (- j) j) 0) (<= (- j (- j)) 0) (<= (- (- i) i) (- 2)) (<= (+ j 1) i) (<= (- (- n) n) (- 2)) (<= n i) (<= j r) (<= (- (- j) n) (- 1)) (<= (- j n) (- 1)) (<= (- (- i) n) (- 2)) (<= 1 (+ j i)) (<= 1 (+ i r)) (forall ((v_idx_273 Int)) (or (= j (select a v_idx_273)) (< v_idx_273 j) (<= i v_idx_273))) (<= (- j r) 0) (<= (- (- i) (- n)) 0) (<= (- (- i) (- r)) (- 1)) (<= (- (- i) r) (- 1)) (<= (- (- j) r) 0) (<= (- (- n) r) (- 1)) (<= (- (- i) j) (- 1)) (<= (* 2 j) 0) (<= (+ j 1) n) (<= 2 (* 2 i)) (<= (- (- i) (- j)) (- 1)) (<= (- (- r) r) 0) (<= 1 (+ n j)) (<= (- (- n) (- r)) (- 1)) (<= 2 (+ n i)))} [2019-02-28 13:38:55,363 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:38:55,363 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:38:55,363 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:38:55,364 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:38:55,364 WARN L224 ngHoareTripleChecker]: Pre: {84#(forall ((v_idx_276 Int)) (and (<= 0 (* 2 c_j)) (<= (- (- c_i) c_j) 0) (<= 0 (* 2 c_i)) (<= 0 (+ c_j c_i)) (<= c_j c_i) (<= (- (- c_i) c_i) 0) (<= (* 2 c_j) 0) (<= (- (- c_j) c_j) 0) (<= (- c_j (- c_j)) 0) (or (= c_j (select c_a v_idx_276)) (<= c_i v_idx_276) (< v_idx_276 c_j)) (<= (- (- c_i) (- c_j)) 0)))} [2019-02-28 13:38:55,364 WARN L228 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-02-28 13:38:55,364 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-02-28 13:38:55,364 WARN L230 ngHoareTripleChecker]: Post: {85#false} [2019-02-28 13:38:55,364 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:38:55,365 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:38:55,365 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:38:55,424 WARN L270 ngHoareTripleChecker]: Pre: {84#(and (<= 0 (* 2 j)) (<= (- (- i) j) 0) (<= 0 (* 2 i)) (<= 0 (+ j i)) (<= j i) (<= (- (- i) i) 0) (<= (* 2 j) 0) (<= (- (- j) j) 0) (<= (- j (- j)) 0) (forall ((v_idx_276 Int)) (or (= j (select a v_idx_276)) (<= i v_idx_276) (< v_idx_276 j))) (<= (- (- i) (- j)) 0))} [2019-02-28 13:38:55,425 WARN L274 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-02-28 13:38:55,425 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-02-28 13:38:55,426 WARN L276 ngHoareTripleChecker]: Post: {85#false} [2019-02-28 13:38:55,427 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:38:55,427 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:38:55,427 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_281 [b_25] v_282 [b_26] v_283 [inf_0], [old(a)] -> [-inf_0] v_647 [inf_0], }, Substate: {ints: {b_26 = [0; inf]; v_282 = [0; 0]; b_25 = [0; 0]; j = [0; 0]; i = [0; inf]}, 9 vars top, relations: {b_25 + b_26 = [0; inf]; b_25 - b_26 = [-inf; 0]; b_26 + v_282 = [0; inf]; b_26 - v_282 = [0; inf]; b_25 + v_282 = [0; 0]; b_25 - v_282 = [0; 0]; j + v_282 = [0; 0]; j - v_282 = [0; 0]; i + v_282 = [0; inf]; i - v_282 = [0; inf]; b_26 + j = [0; inf]; b_26 - j = [0; inf]; b_25 + j = [0; 0]; b_25 - j = [0; 0]; i + j = [0; inf]; i - j = [0; inf]; b_26 + i = [0; inf]; b_26 - i = [0; 0]; b_25 + i = [0; inf]; b_25 - i = [-inf; 0]}, }}} [2019-02-28 13:38:55,428 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-02-28 13:38:55,428 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-02-28 13:38:55,428 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:38:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:38:55,448 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:38:55,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:38:55,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 13:38:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:38:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:38:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-02-28 13:38:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:38:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-02-28 13:38:55,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-02-28 13:38:55,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:38:55,471 INFO L225 Difference]: With dead ends: 5 [2019-02-28 13:38:55,471 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:38:55,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:38:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:38:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:38:55,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:38:55,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:38:55,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:38:55,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:38:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:38:55,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:38:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:38:55,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:38:55,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:38:55,475 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:38:55,475 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:38:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:38:55,475 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:38:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:38:55,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:38:55,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:38:55,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:38:55,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:38:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:38:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:38:55,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-02-28 13:38:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:38:55,476 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:38:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:38:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:38:55,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:38:55,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:38:55,517 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 23 35) no Hoare annotation was computed. [2019-02-28 13:38:55,517 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2019-02-28 13:38:55,517 INFO L444 ceAbstractionStarter]: At program point L29-1(lines 29 32) the Hoare annotation is: (forall ((v_idx_186 Int)) (let ((.cse0 (* 2 j))) (and (<= 0 .cse0) (<= 0 (* 2 i)) (<= j i) (<= 0 (+ j i)) (<= .cse0 0) (or (< v_idx_186 j) (= (select a v_idx_186) j) (<= i v_idx_186))))) [2019-02-28 13:38:55,517 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2019-02-28 13:38:55,517 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-02-28 13:38:55,518 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-02-28 13:38:55,519 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-02-28 13:38:55,521 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-02-28 13:38:55,521 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-02-28 13:38:55,521 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2019-02-28 13:38:55,521 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-02-28 13:38:55,522 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-02-28 13:38:55,529 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:38:55 BoogieIcfgContainer [2019-02-28 13:38:55,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:38:55,530 INFO L168 Benchmark]: Toolchain (without parser) took 24297.62 ms. Allocated memory was 134.7 MB in the beginning and 488.1 MB in the end (delta: 353.4 MB). Free memory was 110.0 MB in the beginning and 426.5 MB in the end (delta: -316.4 MB). Peak memory consumption was 36.9 MB. Max. memory is 7.1 GB. [2019-02-28 13:38:55,532 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:38:55,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 134.7 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-02-28 13:38:55,533 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:38:55,534 INFO L168 Benchmark]: RCFGBuilder took 295.84 ms. Allocated memory is still 134.7 MB. Free memory was 106.9 MB in the beginning and 97.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:38:55,535 INFO L168 Benchmark]: TraceAbstraction took 23936.70 ms. Allocated memory was 134.7 MB in the beginning and 488.1 MB in the end (delta: 353.4 MB). Free memory was 97.1 MB in the beginning and 426.5 MB in the end (delta: -329.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-02-28 13:38:55,540 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 134.7 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.84 ms. Allocated memory is still 134.7 MB. Free memory was 106.9 MB in the beginning and 97.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23936.70 ms. Allocated memory was 134.7 MB in the beginning and 488.1 MB in the end (delta: 353.4 MB). Free memory was 97.1 MB in the beginning and 426.5 MB in the end (delta: -329.4 MB). Peak memory consumption was 24.0 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_186 : int :: ((((0 <= 2 * j && 0 <= 2 * i) && j <= i) && 0 <= j + i) && 2 * j <= 0) && ((v_idx_186 < j || a[v_idx_186] == j) || i <= v_idx_186)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 23.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 3 SDs, 0 SdLazy, 5 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s 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, 17.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 37 HoareAnnotationTreeSize, 1 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s 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...