java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:19:10,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:19:10,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:19:10,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:19:10,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:19:10,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:19:10,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:19:10,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:19:10,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:19:10,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:19:10,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:19:10,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:19:10,046 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:19:10,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:19:10,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:19:10,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:19:10,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:19:10,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:19:10,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:19:10,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:19:10,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:19:10,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:19:10,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:19:10,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:19:10,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:19:10,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:19:10,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:19:10,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:19:10,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:19:10,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:19:10,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:19:10,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:19:10,074 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:19:10,074 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:19:10,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:19:10,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:19:10,076 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-14 16:19:10,096 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:19:10,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:19:10,097 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:19:10,097 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:19:10,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:19:10,098 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:19:10,098 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:19:10,098 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:19:10,098 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-14 16:19:10,098 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:19:10,098 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-14 16:19:10,101 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-14 16:19:10,101 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:19:10,101 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:19:10,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:19:10,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:19:10,102 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:19:10,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:19:10,103 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:19:10,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:19:10,103 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:19:10,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:19:10,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:19:10,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:19:10,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:19:10,107 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:19:10,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:19:10,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:19:10,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:19:10,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:19:10,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:19:10,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:19:10,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:19:10,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:19:10,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:19:10,111 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:19:10,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:19:10,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:19:10,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:19:10,112 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:19:10,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:19:10,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:19:10,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:19:10,195 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:19:10,195 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:19:10,196 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-14 16:19:10,197 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-02-14 16:19:10,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:19:10,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:19:10,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:19:10,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:19:10,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:19:10,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,273 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-14 16:19:10,274 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-14 16:19:10,274 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-14 16:19:10,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:19:10,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:19:10,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:19:10,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:19:10,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/1) ... [2019-02-14 16:19:10,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:19:10,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:19:10,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:19:10,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:19:10,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (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-02-14 16:19:10,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-14 16:19:10,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-14 16:19:10,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-14 16:19:10,643 INFO L278 CfgBuilder]: Using library mode [2019-02-14 16:19:10,644 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-14 16:19:10,645 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:19:10 BoogieIcfgContainer [2019-02-14 16:19:10,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:19:10,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:19:10,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:19:10,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:19:10,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:19:10" (1/2) ... [2019-02-14 16:19:10,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38467456 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:19:10, skipping insertion in model container [2019-02-14 16:19:10,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:19:10" (2/2) ... [2019-02-14 16:19:10,653 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-02-14 16:19:10,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:19:10,671 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:19:10,694 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:19:10,764 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:19:10,764 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:19:10,765 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:19:10,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:19:10,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:19:10,765 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:19:10,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:19:10,765 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:19:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-14 16:19:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:19:10,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:10,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:19:10,816 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-14 16:19:10,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:10,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:11,057 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-02-14 16:19:11,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-02-14 16:19:11,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-02-14 16:19:11,065 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-14 16:19:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:19:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:19:11,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:19:11,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:19:11,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:11,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:19:11,099 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-14 16:19:11,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:19:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:19:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:19:11,113 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-14 16:19:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:11,227 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-14 16:19:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:19:11,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:19:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:19:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-14 16:19:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:19:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-14 16:19:11,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-02-14 16:19:11,279 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-14 16:19:11,289 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:19:11,289 INFO L226 Difference]: Without dead ends: 5 [2019-02-14 16:19:11,292 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-14 16:19:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-14 16:19:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-14 16:19:11,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:11,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:11,358 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:11,358 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:11,360 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:19:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:19:11,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:11,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:11,361 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:11,362 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-14 16:19:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:11,363 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-14 16:19:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:19:11,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:11,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:11,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:11,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-14 16:19:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-14 16:19:11,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-14 16:19:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:11,368 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-14 16:19:11,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:19:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-14 16:19:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:19:11,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:11,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:19:11,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-02-14 16:19:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:11,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:11,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:11,996 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-02-14 16:19:12,000 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-02-14 16:19:12,001 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-14 16:19:12,002 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-14 16:19:12,004 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-02-14 16:19:12,004 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-14 16:19:12,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:12,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:12,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:19:12,008 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-02-14 16:19:12,058 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-14 16:19:12,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:19:12,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:19:12,317 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-14 16:19:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:12,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:19:12,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:12,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:12,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:12,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:19:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:12,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:12,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:12,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:12,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:12,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:12,506 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:12,507 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_5, v_i_5]. (and (= a (store v_a_5 v_i_5 0)) (<= i (+ v_i_5 1)) (<= v_i_5 0)) [2019-02-14 16:19:12,507 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_5]. (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)) [2019-02-14 16:19:12,780 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-02-14 16:19:12,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {56#(exists ((v_i_5 Int)) (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)))} is VALID [2019-02-14 16:19:12,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#(exists ((v_i_5 Int)) (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)))} assume !(i < n);assume 0 <= r && r < n; {48#(and (= r 0) (= 0 (select a r)))} is VALID [2019-02-14 16:19:12,799 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-02-14 16:19:12,800 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-14 16:19:12,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:13,292 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-02-14 16:19:13,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-14 16:19:13,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:13,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:13,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-14 16:19:13,535 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select a r) 0)} assume !(a[r] == 0); {45#false} is VALID [2019-02-14 16:19:13,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {67#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= (select a r) 0)))} assume !(i < n);assume 0 <= r && r < n; {63#(= (select a r) 0)} is VALID [2019-02-14 16:19:13,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {67#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= (select a r) 0)))} is VALID [2019-02-14 16:19:13,557 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-02-14 16:19:13,558 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-14 16:19:13,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:13,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-14 16:19:13,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:13,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-14 16:19:13,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:13,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-14 16:19:13,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-14 16:19:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-14 16:19:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:19:13,595 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-02-14 16:19:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:13,716 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:19:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:19:13,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-14 16:19:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:19:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-02-14 16:19:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:19:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-02-14 16:19:13,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2019-02-14 16:19:13,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:13,844 INFO L225 Difference]: With dead ends: 8 [2019-02-14 16:19:13,845 INFO L226 Difference]: Without dead ends: 6 [2019-02-14 16:19:13,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-14 16:19:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-14 16:19:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-14 16:19:13,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:13,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-02-14 16:19:13,858 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-14 16:19:13,858 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-14 16:19:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:13,859 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-14 16:19:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-14 16:19:13,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:13,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:13,860 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-14 16:19:13,860 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-14 16:19:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:13,861 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-14 16:19:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-14 16:19:13,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:13,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:13,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:13,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:19:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-14 16:19:13,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-14 16:19:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:13,864 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-14 16:19:13,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-14 16:19:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-14 16:19:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:19:13,864 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:13,864 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-14 16:19:13,865 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-02-14 16:19:13,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:13,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:13,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:13,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:14,090 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {109#(= i 0)} is VALID [2019-02-14 16:19:14,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {110#(and (<= i 1) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:14,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= i 1) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {111#(and (<= i 2) (or (<= i 1) (= 0 (select a 1))) (= 0 (select a 0)))} is VALID [2019-02-14 16:19:14,097 INFO L273 TraceCheckUtils]: 3: Hoare triple {111#(and (<= i 2) (or (<= i 1) (= 0 (select a 1))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {112#(= 0 (select a r))} is VALID [2019-02-14 16:19:14,098 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-02-14 16:19:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:14,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:14,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:14,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:14,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:14,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:14,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:14,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-14 16:19:14,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-14 16:19:14,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-14 16:19:14,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:14,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:14,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:14,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:14,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:14,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:14,190 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:14,190 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_7, v_i_7]. (and (= a (store v_a_7 v_i_7 0)) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2019-02-14 16:19:14,191 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_7]. (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2019-02-14 16:19:14,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:19:14,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:14,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:14,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-14 16:19:14,306 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:14,306 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_8, v_i_8, v_i_7]. (and (= 0 (select v_a_8 v_i_7)) (= a (store v_a_8 v_i_8 0)) (<= v_i_8 (+ v_i_7 1)) (<= v_i_7 0) (<= i (+ v_i_8 1))) [2019-02-14 16:19:14,306 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_7, v_i_8]. (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= i (+ v_i_8 1))) [2019-02-14 16:19:14,425 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-02-14 16:19:14,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {120#(exists ((v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))))} is VALID [2019-02-14 16:19:14,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#(exists ((v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))))} assume i < n;a := a[i := 0];i := i + 1; {124#(exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= i (+ v_i_8 1))))} is VALID [2019-02-14 16:19:14,438 INFO L273 TraceCheckUtils]: 3: Hoare triple {124#(exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= i (+ v_i_8 1))))} assume !(i < n);assume 0 <= r && r < n; {128#(and (exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= r v_i_8))) (<= 0 r))} is VALID [2019-02-14 16:19:14,439 INFO L273 TraceCheckUtils]: 4: Hoare triple {128#(and (exists ((v_i_8 Int) (v_i_7 Int)) (and (= 0 (select a v_i_7)) (<= v_i_8 (+ v_i_7 1)) (= (select a v_i_8) 0) (<= v_i_7 0) (<= r v_i_8))) (<= 0 r))} assume !(a[r] == 0); {108#false} is VALID [2019-02-14 16:19:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:14,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:14,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-14 16:19:14,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:14,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:14,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-14 16:19:14,656 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-02-14 16:19:14,657 INFO L273 TraceCheckUtils]: 3: Hoare triple {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {112#(= 0 (select a r))} is VALID [2019-02-14 16:19:14,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:14,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {135#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:14,661 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-02-14 16:19:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-14 16:19:14,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:14,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-02-14 16:19:14,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:14,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-14 16:19:14,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:14,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-14 16:19:14,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:14,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-14 16:19:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-14 16:19:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:19:14,702 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-02-14 16:19:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:14,926 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-14 16:19:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-14 16:19:14,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-14 16:19:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:19:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-14 16:19:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:19:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-14 16:19:14,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2019-02-14 16:19:14,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:14,940 INFO L225 Difference]: With dead ends: 9 [2019-02-14 16:19:14,941 INFO L226 Difference]: Without dead ends: 7 [2019-02-14 16:19:14,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-14 16:19:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-14 16:19:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-14 16:19:14,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:14,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-14 16:19:14,957 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:19:14,957 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:19:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:14,958 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-14 16:19:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:19:14,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:14,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:14,959 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:19:14,959 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:19:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:14,960 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-14 16:19:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:19:14,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:14,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:14,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:14,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:19:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-14 16:19:14,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-14 16:19:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:14,962 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-14 16:19:14,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-14 16:19:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:19:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:19:14,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:14,963 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-14 16:19:14,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-02-14 16:19:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:14,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:14,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:15,273 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {188#(= i 0)} is VALID [2019-02-14 16:19:15,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {189#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:15,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {190#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:15,278 INFO L273 TraceCheckUtils]: 3: Hoare triple {190#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {191#(and (or (<= i 1) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} is VALID [2019-02-14 16:19:15,279 INFO L273 TraceCheckUtils]: 4: Hoare triple {191#(and (or (<= i 1) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {192#(= 0 (select a r))} is VALID [2019-02-14 16:19:15,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-02-14 16:19:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:15,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:15,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:15,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:15,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:15,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:15,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:15,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-14 16:19:15,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-14 16:19:15,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-14 16:19:15,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:15,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:15,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:15,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:15,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:15,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:15,363 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:15,364 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_11, v_i_11]. (and (<= v_i_11 0) (<= i (+ v_i_11 1)) (= a (store v_a_11 v_i_11 0))) [2019-02-14 16:19:15,364 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_11]. (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))) [2019-02-14 16:19:15,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:19:15,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:15,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:15,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-14 16:19:15,524 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:15,524 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_12, v_i_12, v_i_11]. (and (= (select v_a_12 v_i_11) 0) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= a (store v_a_12 v_i_12 0))) [2019-02-14 16:19:15,524 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_12, v_i_11]. (and (<= v_i_12 (+ v_i_11 1)) (= 0 (select a v_i_11)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= 0 (select a v_i_12))) [2019-02-14 16:19:15,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-14 16:19:15,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:15,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:15,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-14 16:19:15,630 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:15,630 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_13, v_i_13, v_i_12, v_i_11]. (and (<= v_i_12 (+ v_i_11 1)) (= 0 (select v_a_13 v_i_12)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (= (store v_a_13 v_i_13 0) a) (<= v_i_11 0) (= (select v_a_13 v_i_11) 0)) [2019-02-14 16:19:15,631 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_12, v_i_11, v_i_13]. (and (<= v_i_12 (+ v_i_11 1)) (= 0 (select a v_i_11)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12))) [2019-02-14 16:19:15,783 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-02-14 16:19:15,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {196#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {200#(exists ((v_i_11 Int)) (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))))} is VALID [2019-02-14 16:19:15,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {200#(exists ((v_i_11 Int)) (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))))} assume i < n;a := a[i := 0];i := i + 1; {204#(exists ((v_i_11 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= 0 (select a v_i_12))))} is VALID [2019-02-14 16:19:15,788 INFO L273 TraceCheckUtils]: 3: Hoare triple {204#(exists ((v_i_11 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_12 1)) (<= v_i_11 0) (= 0 (select a v_i_12))))} assume i < n;a := a[i := 0];i := i + 1; {208#(exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12))))} is VALID [2019-02-14 16:19:15,790 INFO L273 TraceCheckUtils]: 4: Hoare triple {208#(exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= i (+ v_i_13 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12))))} assume !(i < n);assume 0 <= r && r < n; {212#(and (<= 0 r) (exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12)) (<= r v_i_13))))} is VALID [2019-02-14 16:19:15,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#(and (<= 0 r) (exists ((v_i_11 Int) (v_i_13 Int) (v_i_12 Int)) (and (= 0 (select a v_i_11)) (<= v_i_12 (+ v_i_11 1)) (<= v_i_13 (+ v_i_12 1)) (<= v_i_11 0) (= (select a v_i_13) 0) (= 0 (select a v_i_12)) (<= r v_i_13))))} assume !(a[r] == 0); {187#false} is VALID [2019-02-14 16:19:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:15,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:15,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-14 16:19:15,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:16,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:16,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-14 16:19:16,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-02-14 16:19:16,011 INFO L273 TraceCheckUtils]: 4: Hoare triple {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {192#(= 0 (select a r))} is VALID [2019-02-14 16:19:16,013 INFO L273 TraceCheckUtils]: 3: Hoare triple {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:16,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:16,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {196#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {219#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:16,018 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-02-14 16:19:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-14 16:19:16,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:16,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-02-14 16:19:16,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:16,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-14 16:19:16,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:16,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-02-14 16:19:16,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:16,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-14 16:19:16,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-14 16:19:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-02-14 16:19:16,062 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-02-14 16:19:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:16,320 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-14 16:19:16,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:19:16,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-14 16:19:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-14 16:19:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-02-14 16:19:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-14 16:19:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-02-14 16:19:16,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-02-14 16:19:16,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:16,338 INFO L225 Difference]: With dead ends: 10 [2019-02-14 16:19:16,339 INFO L226 Difference]: Without dead ends: 8 [2019-02-14 16:19:16,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-02-14 16:19:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-14 16:19:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-14 16:19:16,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:16,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-14 16:19:16,363 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-14 16:19:16,363 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-14 16:19:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:16,364 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:19:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:19:16,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:16,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:16,365 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-14 16:19:16,365 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-14 16:19:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:16,367 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:19:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:19:16,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:16,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:16,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:16,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:19:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-14 16:19:16,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-14 16:19:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:16,369 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-14 16:19:16,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-14 16:19:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:19:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-14 16:19:16,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:16,370 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-14 16:19:16,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:16,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-02-14 16:19:16,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:16,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:16,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:16,963 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-02-14 16:19:16,996 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {281#(= 0 i)} is VALID [2019-02-14 16:19:16,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {281#(= 0 i)} assume i < n;a := a[i := 0];i := i + 1; {282#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:16,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {282#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {283#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:17,000 INFO L273 TraceCheckUtils]: 3: Hoare triple {283#(and (<= i 2) (or (<= i 1) (= 0 (select (store a i 0) 1))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {284#(and (or (<= i 1) (and (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:17,006 INFO L273 TraceCheckUtils]: 4: Hoare triple {284#(and (or (<= i 1) (and (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {285#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (<= i 3) (= 0 (select a (+ i (- 1))))) (and (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (<= i 4) (= 0 (select a (+ (+ 2 1) (- 1)))))))} is VALID [2019-02-14 16:19:17,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (<= i 3) (= 0 (select a (+ i (- 1))))) (and (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (<= i 4) (= 0 (select a (+ (+ 2 1) (- 1)))))))} assume !(i < n);assume 0 <= r && r < n; {286#(= 0 (select a r))} is VALID [2019-02-14 16:19:17,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-02-14 16:19:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:17,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:17,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:17,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:17,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:17,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:17,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:17,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:17,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:19:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:17,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:17,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:17,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:17,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:17,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:17,101 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:17,101 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_17, v_i_17]. (and (= a (store v_a_17 v_i_17 0)) (<= v_i_17 0) (<= i (+ v_i_17 1))) [2019-02-14 16:19:17,101 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_17]. (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))) [2019-02-14 16:19:17,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:19:17,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:17,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:17,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-14 16:19:17,160 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:17,160 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_18, v_i_18, v_i_17]. (and (<= v_i_17 0) (= 0 (select v_a_18 v_i_17)) (<= i (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (store v_a_18 v_i_18 0) a)) [2019-02-14 16:19:17,161 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_18, v_i_17]. (and (<= v_i_17 0) (<= i (+ v_i_18 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_18 (+ v_i_17 1))) [2019-02-14 16:19:17,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-14 16:19:17,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:17,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:17,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-14 16:19:17,257 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:17,257 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_19, v_i_19, v_i_17, v_i_18]. (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= 0 (select v_a_19 v_i_17)) (= 0 (select v_a_19 v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (store v_a_19 v_i_19 0) a)) [2019-02-14 16:19:17,258 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_19, v_i_17, v_i_18]. (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0)) [2019-02-14 16:19:17,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-14 16:19:17,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:17,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:17,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-14 16:19:17,416 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:17,417 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_20, v_i_20, v_i_19, v_i_17, v_i_18]. (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= 0 (select v_a_20 v_i_18)) (= 0 (select v_a_20 v_i_19)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (= 0 (select v_a_20 v_i_17)) (<= v_i_18 (+ v_i_17 1)) (= (store v_a_20 v_i_20 0) a)) [2019-02-14 16:19:17,417 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_20, v_i_19, v_i_17, v_i_18]. (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20))) [2019-02-14 16:19:17,714 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-02-14 16:19:17,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {290#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {294#(exists ((v_i_17 Int)) (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))))} is VALID [2019-02-14 16:19:17,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#(exists ((v_i_17 Int)) (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))))} assume i < n;a := a[i := 0];i := i + 1; {298#(exists ((v_i_17 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_18 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_18 (+ v_i_17 1))))} is VALID [2019-02-14 16:19:17,722 INFO L273 TraceCheckUtils]: 3: Hoare triple {298#(exists ((v_i_17 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_18 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_18 (+ v_i_17 1))))} assume i < n;a := a[i := 0];i := i + 1; {302#(exists ((v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0)))} is VALID [2019-02-14 16:19:17,729 INFO L273 TraceCheckUtils]: 4: Hoare triple {302#(exists ((v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_17 0) (<= i (+ v_i_19 1)) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0)))} assume i < n;a := a[i := 0];i := i + 1; {306#(exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20))))} is VALID [2019-02-14 16:19:17,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#(exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (= 0 (select a v_i_18)) (<= i (+ v_i_20 1)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20))))} assume !(i < n);assume 0 <= r && r < n; {310#(and (<= 0 r) (exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (<= r v_i_20) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20)))))} is VALID [2019-02-14 16:19:17,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#(and (<= 0 r) (exists ((v_i_20 Int) (v_i_17 Int) (v_i_19 Int) (v_i_18 Int)) (and (<= v_i_20 (+ v_i_19 1)) (<= v_i_17 0) (= (select a v_i_17) 0) (<= r v_i_20) (= 0 (select a v_i_18)) (<= v_i_19 (+ v_i_18 1)) (<= v_i_18 (+ v_i_17 1)) (= (select a v_i_19) 0) (= 0 (select a v_i_20)))))} assume !(a[r] == 0); {280#false} is VALID [2019-02-14 16:19:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:17,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:18,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-14 16:19:18,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:18,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:18,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-14 16:19:18,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-02-14 16:19:18,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {286#(= 0 (select a r))} is VALID [2019-02-14 16:19:18,082 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:18,083 INFO L273 TraceCheckUtils]: 3: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:18,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:18,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {290#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {317#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:18,091 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-02-14 16:19:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-14 16:19:18,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:18,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-02-14 16:19:18,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:18,111 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-14 16:19:18,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:18,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-02-14 16:19:18,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:18,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-14 16:19:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-14 16:19:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-02-14 16:19:18,148 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-02-14 16:19:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:18,687 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-14 16:19:18,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-14 16:19:18,687 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-14 16:19:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-14 16:19:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-14 16:19:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-14 16:19:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-14 16:19:18,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 11 transitions. [2019-02-14 16:19:18,710 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-14 16:19:18,710 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:19:18,710 INFO L226 Difference]: Without dead ends: 9 [2019-02-14 16:19:18,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-02-14 16:19:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-14 16:19:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-14 16:19:18,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:18,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-02-14 16:19:18,731 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-14 16:19:18,731 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-14 16:19:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:18,733 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-14 16:19:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-14 16:19:18,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:18,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:18,733 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-14 16:19:18,734 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-14 16:19:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:18,734 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-14 16:19:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-14 16:19:18,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:18,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:18,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:18,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-14 16:19:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-14 16:19:18,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-14 16:19:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:18,737 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-14 16:19:18,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-14 16:19:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-14 16:19:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-14 16:19:18,737 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:18,737 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-14 16:19:18,738 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-02-14 16:19:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:18,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:19:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:18,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:19,602 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-02-14 16:19:19,777 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {390#(= i 0)} is VALID [2019-02-14 16:19:19,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {391#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:19,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {391#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {392#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:19,782 INFO L273 TraceCheckUtils]: 3: Hoare triple {392#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {393#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:19,784 INFO L273 TraceCheckUtils]: 4: Hoare triple {393#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {394#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:19,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {394#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {395#(and (or (<= i 1) (and (= 0 (select a (+ (+ i (- 1)) (- 1)))) (or (and (= 0 (select a 1)) (<= i 4)) (and (= 0 (select a (+ (+ (+ i (- 1)) (- 1)) (- 1)))) (= 0 (select a 1)) (<= i 5))) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} is VALID [2019-02-14 16:19:19,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(and (or (<= i 1) (and (= 0 (select a (+ (+ i (- 1)) (- 1)))) (or (and (= 0 (select a 1)) (<= i 4)) (and (= 0 (select a (+ (+ (+ i (- 1)) (- 1)) (- 1)))) (= 0 (select a 1)) (<= i 5))) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {396#(= 0 (select a r))} is VALID [2019-02-14 16:19:19,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-02-14 16:19:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:19,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:19,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:19,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:19,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:19,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:19,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:19,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-14 16:19:19,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-14 16:19:19,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-14 16:19:19,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:19,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:19,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:19,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:19,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:19,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:20,014 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:20,014 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_25, v_i_25]. (and (<= i (+ v_i_25 1)) (= (store v_a_25 v_i_25 0) a) (<= v_i_25 0)) [2019-02-14 16:19:20,015 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_25]. (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)) [2019-02-14 16:19:20,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:19:20,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:20,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:20,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-14 16:19:20,146 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:20,146 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_26, v_i_26, v_i_25]. (and (= (select v_a_26 v_i_25) 0) (= (store v_a_26 v_i_26 0) a) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))) [2019-02-14 16:19:20,147 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_25, v_i_26]. (and (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))) [2019-02-14 16:19:20,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-14 16:19:20,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:20,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:20,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-14 16:19:20,309 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:20,309 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_27, v_i_27, v_i_26, v_i_25]. (and (<= v_i_27 (+ v_i_26 1)) (= (select v_a_27 v_i_26) 0) (= 0 (select v_a_27 v_i_25)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1)) (= a (store v_a_27 v_i_27 0))) [2019-02-14 16:19:20,310 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_27, v_i_26, v_i_25]. (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1))) [2019-02-14 16:19:20,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-14 16:19:20,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:20,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:20,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-14 16:19:20,613 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:20,614 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_28, v_i_28, v_i_27, v_i_26, v_i_25]. (and (<= v_i_27 (+ v_i_26 1)) (<= v_i_28 (+ v_i_27 1)) (= 0 (select v_a_28 v_i_26)) (<= i (+ v_i_28 1)) (= (select v_a_28 v_i_27) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (store v_a_28 v_i_28 0) a) (= (select v_a_28 v_i_25) 0)) [2019-02-14 16:19:20,614 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_27, v_i_26, v_i_25, v_i_28]. (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= i (+ v_i_28 1)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_28) 0)) [2019-02-14 16:19:20,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-14 16:19:20,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:20,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:20,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-14 16:19:22,680 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:22,680 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_29, v_i_29, v_i_28, v_i_27, v_i_26, v_i_25]. (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (<= i (+ v_i_29 1)) (= (store v_a_29 v_i_29 0) a) (= 0 (select v_a_29 v_i_28)) (<= v_i_28 (+ v_i_27 1)) (= 0 (select v_a_29 v_i_27)) (= 0 (select v_a_29 v_i_26)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= 0 (select v_a_29 v_i_25))) [2019-02-14 16:19:22,681 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_29, v_i_28, v_i_27, v_i_26, v_i_25]. (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (<= i (+ v_i_29 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0)) [2019-02-14 16:19:23,161 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-02-14 16:19:23,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {400#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {404#(exists ((v_i_25 Int)) (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)))} is VALID [2019-02-14 16:19:23,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#(exists ((v_i_25 Int)) (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)))} assume i < n;a := a[i := 0];i := i + 1; {408#(exists ((v_i_26 Int) (v_i_25 Int)) (and (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))))} is VALID [2019-02-14 16:19:23,198 INFO L273 TraceCheckUtils]: 3: Hoare triple {408#(exists ((v_i_26 Int) (v_i_25 Int)) (and (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_26 1))))} assume i < n;a := a[i := 0];i := i + 1; {412#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1))))} is VALID [2019-02-14 16:19:23,217 INFO L273 TraceCheckUtils]: 4: Hoare triple {412#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (<= i (+ v_i_27 1))))} assume i < n;a := a[i := 0];i := i + 1; {416#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= i (+ v_i_28 1)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_28) 0)))} is VALID [2019-02-14 16:19:23,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {416#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int)) (and (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= i (+ v_i_28 1)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_28) 0)))} assume i < n;a := a[i := 0];i := i + 1; {420#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= i (+ v_i_29 1)) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0)))} is VALID [2019-02-14 16:19:23,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {420#(exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= i (+ v_i_29 1)) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0)))} assume !(i < n);assume 0 <= r && r < n; {424#(and (<= 0 r) (exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= r v_i_29) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0))))} is VALID [2019-02-14 16:19:23,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(and (<= 0 r) (exists ((v_i_26 Int) (v_i_25 Int) (v_i_28 Int) (v_i_27 Int) (v_i_29 Int)) (and (<= v_i_29 (+ v_i_28 1)) (<= v_i_27 (+ v_i_26 1)) (= (select a v_i_25) 0) (<= r v_i_29) (= (select a v_i_26) 0) (<= v_i_28 (+ v_i_27 1)) (= 0 (select a v_i_27)) (<= v_i_25 0) (<= v_i_26 (+ v_i_25 1)) (= (select a v_i_29) 0) (= (select a v_i_28) 0))))} assume !(a[r] == 0); {389#false} is VALID [2019-02-14 16:19:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:23,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:27,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-14 16:19:27,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:27,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:27,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-14 16:19:27,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-02-14 16:19:27,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {396#(= 0 (select a r))} is VALID [2019-02-14 16:19:27,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:27,100 INFO L273 TraceCheckUtils]: 4: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:27,102 INFO L273 TraceCheckUtils]: 3: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:27,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:27,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {400#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {431#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:27,106 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-02-14 16:19:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-14 16:19:27,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:27,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-02-14 16:19:27,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:27,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-02-14 16:19:27,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:27,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-02-14 16:19:27,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:27,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-14 16:19:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-14 16:19:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=196, Unknown=1, NotChecked=0, Total=272 [2019-02-14 16:19:27,442 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-02-14 16:19:28,469 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-02-14 16:19:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:28,527 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-14 16:19:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-14 16:19:28,528 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-02-14 16:19:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-14 16:19:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-02-14 16:19:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-14 16:19:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-02-14 16:19:28,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 12 transitions. [2019-02-14 16:19:28,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:28,599 INFO L225 Difference]: With dead ends: 12 [2019-02-14 16:19:28,599 INFO L226 Difference]: Without dead ends: 10 [2019-02-14 16:19:28,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2019-02-14 16:19:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-14 16:19:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-14 16:19:28,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:28,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:28,715 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:28,715 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:28,717 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-14 16:19:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-14 16:19:28,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:28,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:28,718 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:28,718 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-02-14 16:19:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:28,719 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-14 16:19:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-14 16:19:28,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:28,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:28,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:28,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:19:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-14 16:19:28,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-14 16:19:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:28,721 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-14 16:19:28,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-14 16:19:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-14 16:19:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-14 16:19:28,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:28,722 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-14 16:19:28,722 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-02-14 16:19:28,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:28,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:28,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:29,309 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-02-14 16:19:29,616 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-02-14 16:19:29,663 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {511#(= i 0)} is VALID [2019-02-14 16:19:29,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {511#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {512#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:29,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {513#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:29,667 INFO L273 TraceCheckUtils]: 3: Hoare triple {513#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (<= i 2) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {514#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:29,668 INFO L273 TraceCheckUtils]: 4: Hoare triple {514#(and (<= 3 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {515#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= 4 i) (<= i 4) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:29,670 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (<= 4 i) (<= i 4) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {516#(and (or (and (= 0 (select (store a i 0) (+ 3 (- 1)))) (= 0 (select (store a i 0) 1)) (or (and (= 0 (select (store a i 0) (+ 3 1))) (= 0 (select (store a i 0) (+ (+ 3 1) (- 1)))) (<= i 5)) (<= i 3))) (<= i 1)) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:19:29,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {516#(and (or (and (= 0 (select (store a i 0) (+ 3 (- 1)))) (= 0 (select (store a i 0) 1)) (or (and (= 0 (select (store a i 0) (+ 3 1))) (= 0 (select (store a i 0) (+ (+ 3 1) (- 1)))) (<= i 5)) (<= i 3))) (<= i 1)) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {517#(and (or (<= i 1) (and (or (and (<= i 6) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ 3 1))) (= 0 (select a (+ (+ 3 1) (- 1))))) (and (<= i 4) (= 0 (select a (+ (+ 3 1) (- 1)))))) (= 0 (select a 1)) (= 0 (select a (+ 3 (- 1))))) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} is VALID [2019-02-14 16:19:29,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(and (or (<= i 1) (and (or (and (<= i 6) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ 3 1))) (= 0 (select a (+ (+ 3 1) (- 1))))) (and (<= i 4) (= 0 (select a (+ (+ 3 1) (- 1)))))) (= 0 (select a 1)) (= 0 (select a (+ 3 (- 1))))) (and (<= i 3) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))))) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {518#(= 0 (select a r))} is VALID [2019-02-14 16:19:29,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-02-14 16:19:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:29,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:29,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:19:29,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:19:29,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:19:29,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:19:29,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:19:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-14 16:19:29,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-14 16:19:29,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-14 16:19:29,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-14 16:19:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:29,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:19:29,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:19:29,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:29,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:29,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:19:29,749 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:29,749 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_35, v_i_35]. (and (<= i (+ v_i_35 1)) (= (store v_a_35 v_i_35 0) a) (<= v_i_35 0)) [2019-02-14 16:19:29,749 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_35]. (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)) [2019-02-14 16:19:29,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:19:29,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:29,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:29,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-14 16:19:29,806 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:29,806 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_36, v_i_36, v_i_35]. (and (<= v_i_36 (+ v_i_35 1)) (= a (store v_a_36 v_i_36 0)) (= (select v_a_36 v_i_35) 0) (<= v_i_35 0) (<= i (+ v_i_36 1))) [2019-02-14 16:19:29,806 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_36, v_i_35]. (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0) (<= i (+ v_i_36 1)) (= (select a v_i_36) 0)) [2019-02-14 16:19:29,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-14 16:19:29,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:29,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:29,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-14 16:19:29,889 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:29,889 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_37, v_i_37, v_i_35, v_i_36]. (and (= (select v_a_37 v_i_35) 0) (<= v_i_36 (+ v_i_35 1)) (<= v_i_35 0) (= (select v_a_37 v_i_36) 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= a (store v_a_37 v_i_37 0))) [2019-02-14 16:19:29,889 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_36, v_i_35, v_i_37]. (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)) [2019-02-14 16:19:30,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-14 16:19:30,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:30,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:30,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-14 16:19:30,103 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:30,104 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_38, v_i_38, v_i_36, v_i_35, v_i_37]. (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (= (select v_a_38 v_i_36) 0) (<= v_i_38 (+ v_i_37 1)) (= (select v_a_38 v_i_35) 0) (= (select v_a_38 v_i_37) 0) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= a (store v_a_38 v_i_38 0))) [2019-02-14 16:19:30,104 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_38, v_i_36, v_i_35, v_i_37]. (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_38) 0) (= (select a v_i_36) 0)) [2019-02-14 16:19:30,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-14 16:19:30,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:30,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:30,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-14 16:19:30,806 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:30,806 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_39, v_i_39, v_i_35, v_i_38, v_i_36, v_i_37]. (and (= (select v_a_39 v_i_35) 0) (= (select v_a_39 v_i_38) 0) (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (<= v_i_38 (+ v_i_37 1)) (= (select v_a_39 v_i_36) 0) (= (select v_a_39 v_i_37) 0) (= a (store v_a_39 v_i_39 0)) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1))) [2019-02-14 16:19:30,807 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_36, v_i_35, v_i_39, v_i_38, v_i_37]. (and (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (= 0 (select a v_i_39)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_38) 0) (= (select a v_i_36) 0)) [2019-02-14 16:19:31,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-14 16:19:31,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:31,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-14 16:19:31,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-14 16:19:33,377 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:19:33,377 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_40, v_i_40, v_i_39, v_i_38, v_i_36, v_i_37, v_i_35]. (and (= a (store v_a_40 v_i_40 0)) (<= v_i_39 (+ v_i_38 1)) (= 0 (select v_a_40 v_i_36)) (= 0 (select v_a_40 v_i_37)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= 0 (select v_a_40 v_i_39)) (= (select v_a_40 v_i_35) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select v_a_40 v_i_38) 0)) [2019-02-14 16:19:33,377 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_39, v_i_40, v_i_38, v_i_36, v_i_35, v_i_37]. (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_38) 0) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0)) [2019-02-14 16:19:38,368 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-02-14 16:19:38,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {522#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {526#(exists ((v_i_35 Int)) (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)))} is VALID [2019-02-14 16:19:38,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {526#(exists ((v_i_35 Int)) (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)))} assume i < n;a := a[i := 0];i := i + 1; {530#(exists ((v_i_35 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0) (= (select a v_i_36) 0) (<= i (+ v_i_36 1))))} is VALID [2019-02-14 16:19:38,377 INFO L273 TraceCheckUtils]: 3: Hoare triple {530#(exists ((v_i_35 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0) (= (select a v_i_36) 0) (<= i (+ v_i_36 1))))} assume i < n;a := a[i := 0];i := i + 1; {534#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} is VALID [2019-02-14 16:19:38,392 INFO L273 TraceCheckUtils]: 4: Hoare triple {534#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int)) (and (<= v_i_36 (+ v_i_35 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (<= i (+ v_i_37 1)) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} assume i < n;a := a[i := 0];i := i + 1; {538#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_38 Int)) (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} is VALID [2019-02-14 16:19:38,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {538#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_38 Int)) (and (<= i (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} assume i < n;a := a[i := 0];i := i + 1; {542#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (= 0 (select a v_i_39)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} is VALID [2019-02-14 16:19:40,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {542#(exists ((v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (<= v_i_36 (+ v_i_35 1)) (<= i (+ v_i_39 1)) (= 0 (select a v_i_39)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (= (select a v_i_36) 0)))} assume i < n;a := a[i := 0];i := i + 1; {546#(exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0)))} is UNKNOWN [2019-02-14 16:19:41,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {546#(exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= i (+ v_i_40 1)) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0)))} assume !(i < n);assume 0 <= r && r < n; {550#(and (<= 0 r) (exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= r v_i_40) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0))))} is VALID [2019-02-14 16:19:41,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {550#(and (<= 0 r) (exists ((v_i_40 Int) (v_i_35 Int) (v_i_37 Int) (v_i_36 Int) (v_i_39 Int) (v_i_38 Int)) (and (= 0 (select a v_i_39)) (= (select a v_i_40) 0) (<= v_i_39 (+ v_i_38 1)) (<= r v_i_40) (<= v_i_36 (+ v_i_35 1)) (<= v_i_38 (+ v_i_37 1)) (= (select a v_i_35) 0) (= (select a v_i_37) 0) (<= v_i_35 0) (= (select a v_i_38) 0) (<= v_i_37 (+ v_i_36 1)) (<= v_i_40 (+ v_i_39 1)) (= (select a v_i_36) 0))))} assume !(a[r] == 0); {510#false} is VALID [2019-02-14 16:19:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:19:41,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:19:45,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-14 16:19:45,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:19:45,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:19:45,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-02-14 16:19:45,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-02-14 16:19:45,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {518#(= 0 (select a r))} is VALID [2019-02-14 16:19:45,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:45,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:45,834 INFO L273 TraceCheckUtils]: 4: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:45,835 INFO L273 TraceCheckUtils]: 3: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:45,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:45,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {522#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {557#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-02-14 16:19:45,838 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-02-14 16:19:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-14 16:19:45,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:19:45,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-02-14 16:19:45,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:19:45,859 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-02-14 16:19:45,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:19:45,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-02-14 16:19:48,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-14 16:19:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-14 16:19:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-02-14 16:19:48,756 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-02-14 16:19:49,473 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-02-14 16:19:57,797 WARN L181 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-02-14 16:19:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:57,840 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-14 16:19:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-14 16:19:57,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-02-14 16:19:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:19:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-14 16:19:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-02-14 16:19:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-14 16:19:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-02-14 16:19:57,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 13 transitions. [2019-02-14 16:19:58,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:19:58,426 INFO L225 Difference]: With dead ends: 13 [2019-02-14 16:19:58,426 INFO L226 Difference]: Without dead ends: 11 [2019-02-14 16:19:58,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-02-14 16:19:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-14 16:19:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-14 16:19:58,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:19:58,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:58,469 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:58,469 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:58,470 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-14 16:19:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-14 16:19:58,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:58,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:58,471 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:58,471 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-02-14 16:19:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:19:58,472 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-14 16:19:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-14 16:19:58,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:19:58,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:19:58,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:19:58,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:19:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-14 16:19:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-14 16:19:58,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-14 16:19:58,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:19:58,474 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-14 16:19:58,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-14 16:19:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-14 16:19:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-14 16:19:58,474 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:19:58,474 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-14 16:19:58,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:19:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:19:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-02-14 16:19:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:19:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:58,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-14 16:19:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:19:58,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:19:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:19:59,043 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-02-14 16:19:59,361 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-02-14 16:19:59,728 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-02-14 16:20:00,101 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-02-14 16:20:00,139 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {646#(= 0 i)} is VALID [2019-02-14 16:20:00,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#(= 0 i)} assume i < n;a := a[i := 0];i := i + 1; {647#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:20:00,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#(and (<= i 1) (<= 1 i) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {648#(and (<= i 2) (or (and (<= 2 i) (= 0 (select (store a i 0) 0))) (= i 0)) (or (<= i 1) (= 0 (select (store a i 0) 1))))} is VALID [2019-02-14 16:20:00,156 INFO L273 TraceCheckUtils]: 3: Hoare triple {648#(and (<= i 2) (or (and (<= 2 i) (= 0 (select (store a i 0) 0))) (= i 0)) (or (<= i 1) (= 0 (select (store a i 0) 1))))} assume i < n;a := a[i := 0];i := i + 1; {649#(and (<= 1 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:20:00,157 INFO L273 TraceCheckUtils]: 4: Hoare triple {649#(and (<= 1 i) (= 0 (select (store a i 0) 1)) (<= i 3) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {650#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:20:00,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {650#(and (<= 2 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ i (- 1)))) (<= i 4) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {651#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (<= 3 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (<= i 5) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:20:00,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {651#(and (= 0 (select (store a i 0) (+ (+ i (- 1)) (- 1)))) (<= 3 i) (= 0 (select (store a i 0) 1)) (= 0 (select (store a i 0) (+ i (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (<= i 5) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {652#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ 2 2))) (= 0 (select (store a i 0) 1)) (<= i 6) (= 0 (select (store a i 0) (+ (+ 2 2) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 2) 1)))) (and (or (<= i 3) (and (= 0 (select (store a i 0) (+ 1 2))) (<= i 4))) (= 0 (select (store a i 0) (+ (+ 1 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 1 2) (- 1)))))) (= 0 (select (store a i 0) 0)))} is VALID [2019-02-14 16:20:00,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#(and (or (<= i 1) (and (= 0 (select (store a i 0) (+ 2 2))) (= 0 (select (store a i 0) 1)) (<= i 6) (= 0 (select (store a i 0) (+ (+ 2 2) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 2 2) 1)))) (and (or (<= i 3) (and (= 0 (select (store a i 0) (+ 1 2))) (<= i 4))) (= 0 (select (store a i 0) (+ (+ 1 1) (- 1)))) (= 0 (select (store a i 0) (+ (+ 1 2) (- 1)))))) (= 0 (select (store a i 0) 0)))} assume i < n;a := a[i := 0];i := i + 1; {653#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (or (and (= 0 (select a (+ 1 1))) (= 0 (select a (+ (+ 1 1) 1))) (<= i 5)) (<= i 3)) (= 0 (select a (+ i (- 1))))) (and (<= i 7) (= 0 (select a (+ 2 2))) (= 0 (select a (+ (+ 2 2) (- 1)))) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ (+ 2 2) 1))) (= 0 (select a (+ (+ 2 1) (- 1)))))))} is VALID [2019-02-14 16:20:00,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {653#(and (= 0 (select a 0)) (or (<= i 1) (and (= 0 (select a (+ (+ 1 1) (- 1)))) (or (and (= 0 (select a (+ 1 1))) (= 0 (select a (+ (+ 1 1) 1))) (<= i 5)) (<= i 3)) (= 0 (select a (+ i (- 1))))) (and (<= i 7) (= 0 (select a (+ 2 2))) (= 0 (select a (+ (+ 2 2) (- 1)))) (= 0 (select a 1)) (= 0 (select a (+ i (- 1)))) (= 0 (select a (+ (+ 2 2) 1))) (= 0 (select a (+ (+ 2 1) (- 1)))))))} assume !(i < n);assume 0 <= r && r < n; {654#(= 0 (select a r))} is VALID [2019-02-14 16:20:00,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2019-02-14 16:20:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:20:00,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:20:00,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:20:00,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-14 16:20:00,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-14 16:20:00,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:20:00,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:20:00,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:20:00,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:20:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:20:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:20:00,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:20:00,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-14 16:20:00,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:00,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:00,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-02-14 16:20:00,253 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:00,253 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_47, v_i_47]. (and (= (store v_a_47 v_i_47 0) a) (<= i (+ v_i_47 1)) (<= v_i_47 0)) [2019-02-14 16:20:00,254 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_47]. (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))) [2019-02-14 16:20:00,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-14 16:20:00,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:00,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:00,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-02-14 16:20:00,414 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:00,414 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_48, v_i_48, v_i_47]. (and (<= v_i_48 (+ v_i_47 1)) (<= v_i_47 0) (= (store v_a_48 v_i_48 0) a) (<= i (+ v_i_48 1)) (= (select v_a_48 v_i_47) 0)) [2019-02-14 16:20:00,414 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_48, v_i_47]. (and (<= v_i_48 (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))) [2019-02-14 16:20:00,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-14 16:20:00,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:00,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:00,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-02-14 16:20:00,515 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:00,516 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_49, v_i_49, v_i_47, v_i_48]. (and (= (store v_a_49 v_i_49 0) a) (<= i (+ v_i_49 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= v_i_49 (+ v_i_48 1)) (= 0 (select v_a_49 v_i_47)) (= (select v_a_49 v_i_48) 0)) [2019-02-14 16:20:00,516 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_49, v_i_47, v_i_48]. (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= v_i_49 (+ v_i_48 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))) [2019-02-14 16:20:00,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-14 16:20:00,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:00,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:00,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-02-14 16:20:00,708 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:00,708 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_50, v_i_50, v_i_49, v_i_48, v_i_47]. (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= (store v_a_50 v_i_50 0) a) (= 0 (select v_a_50 v_i_48)) (= 0 (select v_a_50 v_i_49)) (= 0 (select v_a_50 v_i_47))) [2019-02-14 16:20:00,709 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_50, v_i_49, v_i_48, v_i_47]. (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))) [2019-02-14 16:20:00,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-14 16:20:00,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:00,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:00,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-02-14 16:20:01,202 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:01,203 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_51, v_i_51, v_i_50, v_i_49, v_i_48, v_i_47]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_51 v_i_50)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select v_a_51 v_i_48)) (= 0 (select v_a_51 v_i_47)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1)) (= (select v_a_51 v_i_49) 0) (= a (store v_a_51 v_i_51 0))) [2019-02-14 16:20:01,203 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_50, v_i_49, v_i_51, v_i_48, v_i_47]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_51 1)) (= 0 (select a v_i_50)) (<= v_i_51 (+ v_i_50 1))) [2019-02-14 16:20:01,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-14 16:20:01,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:01,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:01,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-02-14 16:20:04,174 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:04,175 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_52, v_i_52, v_i_50, v_i_49, v_i_47, v_i_48, v_i_51]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_52 v_i_47)) (= 0 (select v_a_52 v_i_48)) (= 0 (select v_a_52 v_i_50)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= a (store v_a_52 v_i_52 0)) (= 0 (select v_a_52 v_i_49)) (<= v_i_51 (+ v_i_50 1)) (= 0 (select v_a_52 v_i_51)) (<= i (+ v_i_52 1))) [2019-02-14 16:20:04,175 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_50, v_i_49, v_i_52, v_i_48, v_i_51, v_i_47]. (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))) [2019-02-14 16:20:06,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-02-14 16:20:06,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:20:06,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-14 16:20:06,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-02-14 16:20:09,178 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:20:09,178 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_a_53, v_i_53, v_i_50, v_i_49, v_i_51, v_i_52, v_i_47, v_i_48]. (and (= 0 (select v_a_53 v_i_50)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select v_a_53 v_i_51)) (= 0 (select v_a_53 v_i_49)) (<= v_i_52 (+ v_i_51 1)) (= 0 (select v_a_53 v_i_47)) (= 0 (select v_a_53 v_i_52)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (<= i (+ v_i_53 1)) (<= v_i_51 (+ v_i_50 1)) (<= v_i_53 (+ v_i_52 1)) (= 0 (select v_a_53 v_i_48)) (= a (store v_a_53 v_i_53 0))) [2019-02-14 16:20:09,178 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_i_53, v_i_50, v_i_49, v_i_52, v_i_48, v_i_51, v_i_47]. (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_51 (+ v_i_50 1)) (<= v_i_53 (+ v_i_52 1))) [2019-02-14 16:20:27,098 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {658#(<= i 0)} is VALID [2019-02-14 16:20:27,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {662#(exists ((v_i_47 Int)) (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))))} is VALID [2019-02-14 16:20:27,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {662#(exists ((v_i_47 Int)) (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))))} assume i < n;a := a[i := 0];i := i + 1; {666#(exists ((v_i_48 Int) (v_i_47 Int)) (and (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))))} is VALID [2019-02-14 16:20:27,107 INFO L273 TraceCheckUtils]: 3: Hoare triple {666#(exists ((v_i_48 Int) (v_i_47 Int)) (and (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (<= i (+ v_i_48 1))))} assume i < n;a := a[i := 0];i := i + 1; {670#(exists ((v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))))} is VALID [2019-02-14 16:20:27,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {670#(exists ((v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_49)) (<= i (+ v_i_49 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48))))} assume i < n;a := a[i := 0];i := i + 1; {674#(exists ((v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))))} is VALID [2019-02-14 16:20:27,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {674#(exists ((v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= i (+ v_i_50 1)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50))))} assume i < n;a := a[i := 0];i := i + 1; {678#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1))))} is VALID [2019-02-14 16:20:29,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {678#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (<= i (+ v_i_51 1)) (<= v_i_51 (+ v_i_50 1))))} assume i < n;a := a[i := 0];i := i + 1; {682#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))))} is VALID [2019-02-14 16:20:31,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {682#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_51 (+ v_i_50 1)) (<= i (+ v_i_52 1))))} assume i < n;a := a[i := 0];i := i + 1; {686#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1))))} is UNKNOWN [2019-02-14 16:20:33,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {686#(exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= i (+ v_i_53 1)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1))))} assume !(i < n);assume 0 <= r && r < n; {690#(and (<= 0 r) (exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= r v_i_53) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1)))))} is UNKNOWN [2019-02-14 16:20:33,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {690#(and (<= 0 r) (exists ((v_i_51 Int) (v_i_50 Int) (v_i_53 Int) (v_i_52 Int) (v_i_48 Int) (v_i_47 Int) (v_i_49 Int)) (and (= 0 (select a v_i_53)) (<= r v_i_53) (<= v_i_50 (+ v_i_49 1)) (= 0 (select a v_i_52)) (= 0 (select a v_i_48)) (= 0 (select a v_i_50)) (= 0 (select a v_i_51)) (= 0 (select a v_i_49)) (<= v_i_52 (+ v_i_51 1)) (<= v_i_49 (+ v_i_48 1)) (<= v_i_47 0) (<= v_i_48 (+ v_i_47 1)) (= 0 (select a v_i_47)) (<= v_i_53 (+ v_i_52 1)) (<= v_i_51 (+ v_i_50 1)))))} assume !(a[r] == 0); {645#false} is VALID [2019-02-14 16:20:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:20:33,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:20:34,354 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-14 16:20:34,555 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:20:34,557 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-02-14 16:20:34,563 INFO L168 Benchmark]: Toolchain (without parser) took 84326.40 ms. Allocated memory was 140.5 MB in the beginning and 369.6 MB in the end (delta: 229.1 MB). Free memory was 108.0 MB in the beginning and 269.3 MB in the end (delta: -161.3 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2019-02-14 16:20:34,564 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:20:34,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.57 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-14 16:20:34,569 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 140.5 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-14 16:20:34,569 INFO L168 Benchmark]: RCFGBuilder took 342.61 ms. Allocated memory is still 140.5 MB. Free memory was 104.7 MB in the beginning and 94.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-02-14 16:20:34,570 INFO L168 Benchmark]: TraceAbstraction took 83915.76 ms. Allocated memory was 140.5 MB in the beginning and 369.6 MB in the end (delta: 229.1 MB). Free memory was 94.7 MB in the beginning and 269.3 MB in the end (delta: -174.6 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2019-02-14 16:20:34,574 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.18 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.57 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.93 ms. Allocated memory is still 140.5 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.61 ms. Allocated memory is still 140.5 MB. Free memory was 104.7 MB in the beginning and 94.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83915.76 ms. Allocated memory was 140.5 MB in the beginning and 369.6 MB in the end (delta: 229.1 MB). Free memory was 94.7 MB in the beginning and 269.3 MB in the end (delta: -174.6 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...