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-f57a05f [2019-01-07 18:19:06,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 18:19:06,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 18:19:06,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 18:19:06,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 18:19:06,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 18:19:06,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 18:19:06,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 18:19:06,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 18:19:06,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 18:19:06,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 18:19:06,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 18:19:06,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 18:19:06,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 18:19:06,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 18:19:06,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 18:19:06,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 18:19:06,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 18:19:06,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 18:19:06,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 18:19:06,208 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 18:19:06,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 18:19:06,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 18:19:06,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 18:19:06,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 18:19:06,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 18:19:06,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 18:19:06,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 18:19:06,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 18:19:06,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 18:19:06,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 18:19:06,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 18:19:06,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 18:19:06,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 18:19:06,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 18:19:06,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 18:19:06,230 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-01-07 18:19:06,251 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 18:19:06,251 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 18:19:06,252 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 18:19:06,252 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 18:19:06,252 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 18:19:06,253 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 18:19:06,253 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 18:19:06,253 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 18:19:06,253 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 18:19:06,254 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 18:19:06,254 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 18:19:06,254 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 18:19:06,254 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 18:19:06,254 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 18:19:06,255 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 18:19:06,255 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 18:19:06,255 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 18:19:06,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 18:19:06,257 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 18:19:06,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 18:19:06,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 18:19:06,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 18:19:06,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 18:19:06,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 18:19:06,258 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 18:19:06,258 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 18:19:06,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 18:19:06,259 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 18:19:06,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 18:19:06,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 18:19:06,259 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 18:19:06,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:19:06,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 18:19:06,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 18:19:06,260 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 18:19:06,260 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 18:19:06,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 18:19:06,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 18:19:06,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 18:19:06,261 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 18:19:06,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 18:19:06,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 18:19:06,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 18:19:06,322 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 18:19:06,322 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 18:19:06,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-07 18:19:06,323 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-07 18:19:06,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 18:19:06,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 18:19:06,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 18:19:06,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 18:19:06,359 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 18:19:06,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,396 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 18:19:06,396 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 18:19:06,396 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 18:19:06,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 18:19:06,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 18:19:06,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 18:19:06,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 18:19:06,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... [2019-01-07 18:19:06,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 18:19:06,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 18:19:06,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 18:19:06,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 18:19:06,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:19:06,495 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-07 18:19:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 18:19:06,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 18:19:06,778 INFO L278 CfgBuilder]: Using library mode [2019-01-07 18:19:06,778 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-07 18:19:06,780 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:19:06 BoogieIcfgContainer [2019-01-07 18:19:06,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 18:19:06,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 18:19:06,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 18:19:06,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 18:19:06,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:19:06" (1/2) ... [2019-01-07 18:19:06,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4f59c4 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 06:19:06, skipping insertion in model container [2019-01-07 18:19:06,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:19:06" (2/2) ... [2019-01-07 18:19:06,789 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-07 18:19:06,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 18:19:06,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 18:19:06,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 18:19:06,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 18:19:06,889 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 18:19:06,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 18:19:06,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 18:19:06,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 18:19:06,889 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 18:19:06,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 18:19:06,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 18:19:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 18:19:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:19:06,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:06,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:19:06,916 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:06,923 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-07 18:19:06,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:06,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:06,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:06,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:06,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:07,128 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-01-07 18:19:07,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-01-07 18:19:07,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-01-07 18:19:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:07,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:19:07,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 18:19:07,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:19:07,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 18:19:07,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:07,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 18:19:07,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:07,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 18:19:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 18:19:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:19:07,193 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 18:19:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:07,307 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 18:19:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:19:07,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 18:19:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:19:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-07 18:19:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:19:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-07 18:19:07,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-07 18:19:07,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:07,369 INFO L225 Difference]: With dead ends: 11 [2019-01-07 18:19:07,370 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 18:19:07,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:19:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 18:19:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 18:19:07,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:07,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 18:19:07,437 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 18:19:07,437 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 18:19:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:07,439 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 18:19:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 18:19:07,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:07,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:07,440 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 18:19:07,440 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 18:19:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:07,441 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 18:19:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 18:19:07,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:07,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:07,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:07,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 18:19:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 18:19:07,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 18:19:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:07,446 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 18:19:07,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 18:19:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 18:19:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 18:19:07,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:07,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 18:19:07,447 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-07 18:19:07,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:07,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:07,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:08,069 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-07 18:19:08,082 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-01-07 18:19:08,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {47#(and (<= i 1) (= 0 (select a 0)))} is VALID [2019-01-07 18:19:08,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(and (<= i 1) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {48#(and (= r 0) (= 0 (select a r)))} is VALID [2019-01-07 18:19:08,100 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-01-07 18:19:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:08,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:08,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:08,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 18:19:08,105 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-07 18:19:08,144 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:19:08,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:19:08,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:19:08,396 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-01-07 18:19:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:08,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:19:08,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:08,404 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-01-07 18:19:08,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:08,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:19:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:08,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:08,740 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-01-07 18:19:08,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:08,767 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-01-07 18:19:08,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:08,771 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:08,772 WARN L385 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-01-07 18:19:08,772 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_5]. (and (<= i (+ v_i_5 1)) (= (select a v_i_5) 0) (<= v_i_5 0)) [2019-01-07 18:19:09,205 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-01-07 18:19:09,207 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-01-07 18:19:09,219 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-01-07 18:19:09,224 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-01-07 18:19:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:09,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:19:09,656 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-01-07 18:19:09,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:09,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:19:09,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:19:09,864 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select a r) 0)} assume !(a[r] == 0); {45#false} is VALID [2019-01-07 18:19:09,865 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-01-07 18:19:09,867 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-01-07 18:19:09,868 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {52#(<= i 0)} is VALID [2019-01-07 18:19:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:19:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-07 18:19:09,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:19:09,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-07 18:19:09,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:09,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-07 18:19:09,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:09,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 18:19:09,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 18:19:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-07 18:19:09,906 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-01-07 18:19:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:10,030 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 18:19:10,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 18:19:10,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-07 18:19:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 18:19:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-07 18:19:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 18:19:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-07 18:19:10,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2019-01-07 18:19:10,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:10,046 INFO L225 Difference]: With dead ends: 8 [2019-01-07 18:19:10,046 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 18:19:10,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-07 18:19:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 18:19:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 18:19:10,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:10,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-07 18:19:10,060 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 18:19:10,060 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 18:19:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:10,061 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 18:19:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 18:19:10,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:10,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:10,062 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 18:19:10,062 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 18:19:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:10,063 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-07 18:19:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 18:19:10,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:10,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:10,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:10,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:19:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-07 18:19:10,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-07 18:19:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:10,066 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-07 18:19:10,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 18:19:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 18:19:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 18:19:10,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:10,067 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 18:19:10,067 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-01-07 18:19:10,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:10,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:10,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:10,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:10,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:10,436 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {109#(= i 0)} is VALID [2019-01-07 18:19:10,438 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-01-07 18:19:10,442 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-01-07 18:19:10,448 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-01-07 18:19:10,450 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-01-07 18:19:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:10,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:10,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:10,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:19:10,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:19:10,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:10,451 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-01-07 18:19:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:19:10,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:19:10,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 18:19:10,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:19:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:10,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:10,538 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-01-07 18:19:10,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:10,557 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-01-07 18:19:10,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:10,566 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:10,567 WARN L385 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-01-07 18:19:10,567 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_7]. (and (= 0 (select a v_i_7)) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2019-01-07 18:19:10,660 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-01-07 18:19:10,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:10,697 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-01-07 18:19:10,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 18:19:10,704 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:10,704 WARN L385 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-01-07 18:19:10,704 WARN L386 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-01-07 18:19:11,054 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-01-07 18:19:11,056 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-01-07 18:19:11,057 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-01-07 18:19:11,059 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-01-07 18:19:11,061 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-01-07 18:19:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:11,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:19:11,281 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-01-07 18:19:11,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:11,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:19:11,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:19:11,305 INFO L273 TraceCheckUtils]: 4: Hoare triple {112#(= 0 (select a r))} assume !(a[r] == 0); {108#false} is VALID [2019-01-07 18:19:11,307 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-01-07 18:19:11,308 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-01-07 18:19:11,310 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-01-07 18:19:11,310 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} i := 0;assume j == i; {116#(<= i 0)} is VALID [2019-01-07 18:19:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 18:19:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:19:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-07 18:19:11,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:19:11,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 18:19:11,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:11,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-07 18:19:11,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:11,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 18:19:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 18:19:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-07 18:19:11,351 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-01-07 18:19:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:11,548 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 18:19:11,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 18:19:11,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 18:19:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 18:19:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-07 18:19:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 18:19:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-07 18:19:11,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 9 transitions. [2019-01-07 18:19:11,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:11,563 INFO L225 Difference]: With dead ends: 9 [2019-01-07 18:19:11,563 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 18:19:11,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-07 18:19:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 18:19:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 18:19:11,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:11,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-07 18:19:11,572 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 18:19:11,573 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 18:19:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:11,574 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-07 18:19:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 18:19:11,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:11,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:11,575 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 18:19:11,575 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 18:19:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:11,577 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-07 18:19:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 18:19:11,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:11,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:11,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:11,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 18:19:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-07 18:19:11,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-07 18:19:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:11,578 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-07 18:19:11,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 18:19:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 18:19:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 18:19:11,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:11,579 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-07 18:19:11,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-01-07 18:19:11,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:11,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:19:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:11,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:11,886 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {188#(= i 0)} is VALID [2019-01-07 18:19:11,889 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-01-07 18:19:11,890 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-01-07 18:19:11,891 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-01-07 18:19:11,892 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-01-07 18:19:11,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-01-07 18:19:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:11,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:11,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:11,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:19:11,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:19:11,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:11,895 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-01-07 18:19:11,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:19:11,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:19:11,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:19:11,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:19:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:11,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:11,957 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-01-07 18:19:11,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:11,965 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-01-07 18:19:11,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:11,969 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:11,969 WARN L385 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-01-07 18:19:11,969 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_11]. (and (= 0 (select a v_i_11)) (<= v_i_11 0) (<= i (+ v_i_11 1))) [2019-01-07 18:19:12,026 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-01-07 18:19:12,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:12,138 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-01-07 18:19:12,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 18:19:12,144 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:12,145 WARN L385 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-01-07 18:19:12,145 WARN L386 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-01-07 18:19:12,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-01-07 18:19:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:12,251 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-01-07 18:19:12,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 18:19:12,262 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:12,263 WARN L385 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-01-07 18:19:12,263 WARN L386 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-01-07 18:19:12,436 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-01-07 18:19:12,438 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-01-07 18:19:12,441 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-01-07 18:19:12,443 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-01-07 18:19:12,446 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-01-07 18:19:12,447 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-01-07 18:19:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:12,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:19:12,674 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-01-07 18:19:12,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:12,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:19:12,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:19:12,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= 0 (select a r))} assume !(a[r] == 0); {187#false} is VALID [2019-01-07 18:19:12,699 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-01-07 18:19:12,700 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-01-07 18:19:12,701 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-01-07 18:19:12,705 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-01-07 18:19:12,705 INFO L273 TraceCheckUtils]: 0: Hoare triple {186#true} i := 0;assume j == i; {196#(<= i 0)} is VALID [2019-01-07 18:19:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 18:19:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:19:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-01-07 18:19:12,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:19:12,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 18:19:12,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:12,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-01-07 18:19:12,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:12,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 18:19:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 18:19:12,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-07 18:19:12,756 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-01-07 18:19:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:13,120 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-07 18:19:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 18:19:13,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 18:19:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 18:19:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-07 18:19:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 18:19:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-07 18:19:13,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-01-07 18:19:13,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:13,141 INFO L225 Difference]: With dead ends: 10 [2019-01-07 18:19:13,141 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 18:19:13,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-07 18:19:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 18:19:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 18:19:13,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:13,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-07 18:19:13,158 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 18:19:13,159 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 18:19:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:13,160 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 18:19:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 18:19:13,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:13,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:13,161 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 18:19:13,161 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 18:19:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:13,163 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 18:19:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 18:19:13,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:13,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:13,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:13,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 18:19:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-07 18:19:13,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-07 18:19:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:13,165 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-07 18:19:13,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 18:19:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 18:19:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 18:19:13,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:13,166 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-07 18:19:13,166 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-01-07 18:19:13,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:13,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:19:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:13,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:13,749 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-01-07 18:19:13,790 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {281#(= 0 i)} is VALID [2019-01-07 18:19:13,792 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-01-07 18:19:13,793 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-01-07 18:19:13,795 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-01-07 18:19:13,800 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-01-07 18:19:13,802 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-01-07 18:19:13,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-01-07 18:19:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:13,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:13,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:19:13,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:19:13,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:13,804 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-01-07 18:19:13,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:13,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:19:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:13,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:13,856 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-01-07 18:19:13,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:13,877 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-01-07 18:19:13,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:13,880 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:13,880 WARN L385 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-01-07 18:19:13,881 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_17]. (and (<= v_i_17 0) (= (select a v_i_17) 0) (<= i (+ v_i_17 1))) [2019-01-07 18:19:13,980 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-01-07 18:19:13,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:14,002 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-01-07 18:19:14,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 18:19:14,008 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:14,008 WARN L385 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-01-07 18:19:14,008 WARN L386 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-01-07 18:19:14,080 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-01-07 18:19:14,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:14,101 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-01-07 18:19:14,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 18:19:14,117 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:14,118 WARN L385 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-01-07 18:19:14,118 WARN L386 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-01-07 18:19:14,198 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-01-07 18:19:14,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:14,230 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-01-07 18:19:14,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 18:19:14,283 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:14,284 WARN L385 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-01-07 18:19:14,284 WARN L386 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-01-07 18:19:14,441 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-01-07 18:19:14,443 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-01-07 18:19:14,445 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-01-07 18:19:14,449 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-01-07 18:19:14,457 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-01-07 18:19:14,462 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-01-07 18:19:14,464 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-01-07 18:19:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:14,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:19:14,795 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-01-07 18:19:14,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:14,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-01-07 18:19:14,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:19:14,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= 0 (select a r))} assume !(a[r] == 0); {280#false} is VALID [2019-01-07 18:19:14,823 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-01-07 18:19:14,824 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-01-07 18:19:14,825 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-01-07 18:19:14,826 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-01-07 18:19:14,827 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-01-07 18:19:14,828 INFO L273 TraceCheckUtils]: 0: Hoare triple {279#true} i := 0;assume j == i; {290#(<= i 0)} is VALID [2019-01-07 18:19:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 18:19:14,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:19:14,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-01-07 18:19:14,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:19:14,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-07 18:19:14,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:14,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-01-07 18:19:14,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:14,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 18:19:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 18:19:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-01-07 18:19:14,883 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-01-07 18:19:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:15,388 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 18:19:15,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 18:19:15,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-07 18:19:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 18:19:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-07 18:19:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 18:19:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-07 18:19:15,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 11 transitions. [2019-01-07 18:19:15,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:15,414 INFO L225 Difference]: With dead ends: 11 [2019-01-07 18:19:15,414 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 18:19:15,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-07 18:19:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 18:19:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 18:19:15,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:15,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-07 18:19:15,476 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 18:19:15,476 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 18:19:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:15,477 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 18:19:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-07 18:19:15,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:15,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:15,477 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 18:19:15,478 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 18:19:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:15,478 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 18:19:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-07 18:19:15,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:15,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:15,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:15,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 18:19:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-07 18:19:15,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-07 18:19:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:15,480 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-07 18:19:15,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 18:19:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-07 18:19:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 18:19:15,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:15,481 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-07 18:19:15,481 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-01-07 18:19:15,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:15,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:15,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:15,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:15,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:16,509 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-01-07 18:19:16,714 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {390#(= i 0)} is VALID [2019-01-07 18:19:16,715 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-01-07 18:19:16,717 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-01-07 18:19:16,720 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-01-07 18:19:16,723 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-01-07 18:19:16,725 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-01-07 18:19:16,726 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-01-07 18:19:16,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-01-07 18:19:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:16,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:16,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:16,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:19:16,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:19:16,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:16,730 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-01-07 18:19:16,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:19:16,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:19:16,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 18:19:16,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:19:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:16,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:16,844 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-01-07 18:19:16,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:16,874 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-01-07 18:19:16,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:16,883 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:16,884 WARN L385 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-01-07 18:19:16,884 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_25]. (and (<= i (+ v_i_25 1)) (= (select a v_i_25) 0) (<= v_i_25 0)) [2019-01-07 18:19:17,168 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-01-07 18:19:17,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:17,184 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-01-07 18:19:17,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 18:19:17,192 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:17,192 WARN L385 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-01-07 18:19:17,193 WARN L386 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-01-07 18:19:17,330 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-01-07 18:19:17,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:17,350 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-01-07 18:19:17,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 18:19:17,356 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:17,357 WARN L385 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-01-07 18:19:17,357 WARN L386 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-01-07 18:19:17,429 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-01-07 18:19:17,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:17,457 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-01-07 18:19:17,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 18:19:17,670 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:17,670 WARN L385 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-01-07 18:19:17,670 WARN L386 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-01-07 18:19:17,800 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-01-07 18:19:17,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:17,841 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-01-07 18:19:17,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 18:19:19,778 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:19,778 WARN L385 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-01-07 18:19:19,778 WARN L386 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-01-07 18:19:20,253 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-01-07 18:19:20,268 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-01-07 18:19:20,278 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-01-07 18:19:20,282 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-01-07 18:19:20,297 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-01-07 18:19:20,611 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-01-07 18:19:20,652 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-01-07 18:19:20,656 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-01-07 18:19:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:20,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:19:24,464 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-01-07 18:19:24,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:24,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:19:24,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:19:24,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {396#(= 0 (select a r))} assume !(a[r] == 0); {389#false} is VALID [2019-01-07 18:19:24,488 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-01-07 18:19:24,489 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-01-07 18:19:24,490 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-01-07 18:19:24,492 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-01-07 18:19:24,493 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-01-07 18:19:24,495 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-01-07 18:19:24,496 INFO L273 TraceCheckUtils]: 0: Hoare triple {388#true} i := 0;assume j == i; {400#(<= i 0)} is VALID [2019-01-07 18:19:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 18:19:24,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:19:24,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-01-07 18:19:24,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:19:24,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-07 18:19:24,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:24,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-07 18:19:24,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:24,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 18:19:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 18:19:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=196, Unknown=1, NotChecked=0, Total=272 [2019-01-07 18:19:24,854 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-01-07 18:19:25,900 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-07 18:19:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:25,961 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 18:19:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 18:19:25,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-07 18:19:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:19:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-07 18:19:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:19:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-07 18:19:25,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 12 transitions. [2019-01-07 18:19:26,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:26,035 INFO L225 Difference]: With dead ends: 12 [2019-01-07 18:19:26,035 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 18:19:26,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2019-01-07 18:19:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 18:19:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-07 18:19:26,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:26,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-01-07 18:19:26,111 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-07 18:19:26,111 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-07 18:19:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:26,113 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-07 18:19:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-07 18:19:26,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:26,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:26,114 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-07 18:19:26,114 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-07 18:19:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:26,115 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-07 18:19:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-07 18:19:26,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:26,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:26,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:26,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 18:19:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-07 18:19:26,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-07 18:19:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:26,117 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-07 18:19:26,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 18:19:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-07 18:19:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 18:19:26,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:26,117 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-07 18:19:26,117 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-01-07 18:19:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:26,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:19:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:26,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:26,681 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-01-07 18:19:26,993 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-01-07 18:19:27,028 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {511#(= i 0)} is VALID [2019-01-07 18:19:27,029 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-01-07 18:19:27,030 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-01-07 18:19:27,031 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-01-07 18:19:27,032 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-01-07 18:19:27,034 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-01-07 18:19:27,037 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-01-07 18:19:27,039 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-01-07 18:19:27,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-01-07 18:19:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:27,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:27,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:27,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:19:27,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:19:27,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:27,041 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-01-07 18:19:27,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:19:27,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:19:27,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:19:27,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:19:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:27,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:27,131 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-01-07 18:19:27,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:27,141 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-01-07 18:19:27,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:27,145 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:27,145 WARN L385 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-01-07 18:19:27,145 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_35]. (and (<= i (+ v_i_35 1)) (= (select a v_i_35) 0) (<= v_i_35 0)) [2019-01-07 18:19:27,186 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-01-07 18:19:27,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:27,201 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-01-07 18:19:27,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 18:19:27,206 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:27,206 WARN L385 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-01-07 18:19:27,206 WARN L386 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-01-07 18:19:27,260 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-01-07 18:19:27,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:27,289 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-01-07 18:19:27,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 18:19:27,296 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:27,297 WARN L385 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-01-07 18:19:27,297 WARN L386 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-01-07 18:19:27,437 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-01-07 18:19:27,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:27,464 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-01-07 18:19:27,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 18:19:27,535 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:27,535 WARN L385 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-01-07 18:19:27,535 WARN L386 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-01-07 18:19:27,658 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-01-07 18:19:27,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:27,689 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-01-07 18:19:27,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 18:19:28,246 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:28,246 WARN L385 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-01-07 18:19:28,247 WARN L386 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-01-07 18:19:28,657 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-01-07 18:19:28,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:28,698 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-01-07 18:19:28,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-07 18:19:30,779 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:30,780 WARN L385 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-01-07 18:19:30,780 WARN L386 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-01-07 18:19:35,809 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-01-07 18:19:35,810 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-01-07 18:19:35,812 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-01-07 18:19:35,817 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-01-07 18:19:35,824 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-01-07 18:19:35,944 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-01-07 18:19:37,979 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-01-07 18:19:38,630 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-01-07 18:19:38,640 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-01-07 18:19:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:38,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:19:41,021 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-01-07 18:19:41,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:41,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:19:41,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:19:41,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(= 0 (select a r))} assume !(a[r] == 0); {510#false} is VALID [2019-01-07 18:19:41,087 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-01-07 18:19:41,088 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-01-07 18:19:41,094 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-01-07 18:19:41,096 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-01-07 18:19:41,097 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-01-07 18:19:41,100 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-01-07 18:19:41,101 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-01-07 18:19:41,106 INFO L273 TraceCheckUtils]: 0: Hoare triple {509#true} i := 0;assume j == i; {522#(<= i 0)} is VALID [2019-01-07 18:19:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-07 18:19:41,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:19:41,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-01-07 18:19:41,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:19:41,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-07 18:19:41,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:19:41,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-01-07 18:19:43,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:43,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 18:19:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 18:19:43,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-01-07 18:19:43,945 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-01-07 18:19:44,603 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-01-07 18:19:52,882 WARN L181 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-07 18:19:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:52,929 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-07 18:19:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 18:19:52,929 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-07 18:19:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:19:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 18:19:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-07 18:19:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 18:19:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-07 18:19:52,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 13 transitions. [2019-01-07 18:19:53,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:19:53,547 INFO L225 Difference]: With dead ends: 13 [2019-01-07 18:19:53,547 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 18:19:53,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-01-07 18:19:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 18:19:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 18:19:53,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:19:53,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-07 18:19:53,613 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 18:19:53,614 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 18:19:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:53,616 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 18:19:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 18:19:53,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:53,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:53,616 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 18:19:53,617 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 18:19:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:19:53,618 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 18:19:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 18:19:53,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:19:53,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:19:53,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:19:53,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:19:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 18:19:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-07 18:19:53,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-07 18:19:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:19:53,620 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-07 18:19:53,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 18:19:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 18:19:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 18:19:53,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:19:53,621 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-07 18:19:53,621 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:19:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:19:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-01-07 18:19:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:19:53,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:53,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:19:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:19:53,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:19:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:54,226 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-01-07 18:19:54,451 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-01-07 18:19:54,740 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-07 18:19:55,096 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-01-07 18:19:55,135 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {646#(= 0 i)} is VALID [2019-01-07 18:19:55,137 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-01-07 18:19:55,152 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-01-07 18:19:55,154 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-01-07 18:19:55,155 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-01-07 18:19:55,156 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-01-07 18:19:55,159 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-01-07 18:19:55,162 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-01-07 18:19:55,164 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-01-07 18:19:55,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2019-01-07 18:19:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:19:55,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:55,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:19:55,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:19:55,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:19:55,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:19:55,167 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-01-07 18:19:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:19:55,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:19:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:19:55,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:19:55,241 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-01-07 18:19:55,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:55,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-01-07 18:19:55,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 18:19:55,252 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:55,253 WARN L385 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-01-07 18:19:55,253 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_i_47]. (and (<= i (+ v_i_47 1)) (<= v_i_47 0) (= 0 (select a v_i_47))) [2019-01-07 18:19:55,293 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-01-07 18:19:55,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:55,374 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-01-07 18:19:55,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 18:19:55,382 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:55,383 WARN L385 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-01-07 18:19:55,383 WARN L386 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-01-07 18:19:55,440 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-01-07 18:19:55,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:55,462 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-01-07 18:19:55,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 18:19:55,473 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:55,473 WARN L385 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-01-07 18:19:55,473 WARN L386 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-01-07 18:19:55,584 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-01-07 18:19:55,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:55,640 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-01-07 18:19:55,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 18:19:55,669 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:55,669 WARN L385 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-01-07 18:19:55,669 WARN L386 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-01-07 18:19:55,795 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-01-07 18:19:55,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:55,833 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-01-07 18:19:55,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 18:19:57,218 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:57,218 WARN L385 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-01-07 18:19:57,219 WARN L386 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-01-07 18:19:57,776 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-01-07 18:19:57,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:19:57,812 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-01-07 18:19:57,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-07 18:19:59,884 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:19:59,885 WARN L385 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-01-07 18:19:59,885 WARN L386 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-01-07 18:20:02,207 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-01-07 18:20:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:20:02,255 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-01-07 18:20:02,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-07 18:20:04,342 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:20:04,342 WARN L385 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-01-07 18:20:04,343 WARN L386 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-01-07 18:20:22,290 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {658#(<= i 0)} is VALID [2019-01-07 18:20:22,291 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-01-07 18:20:22,292 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-01-07 18:20:22,294 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-01-07 18:20:22,310 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-01-07 18:20:22,531 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-01-07 18:20:24,575 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 UNKNOWN [2019-01-07 18:20:26,669 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-01-07 18:20:28,948 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-01-07 18:20:28,971 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-01-07 18:20:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:20:28,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:20:41,253 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-01-07 18:20:41,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:20:41,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:20:41,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 18:20:41,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(= 0 (select a r))} assume !(a[r] == 0); {645#false} is VALID [2019-01-07 18:20:41,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume !(i < n);assume 0 <= r && r < n; {654#(= 0 (select a r))} is VALID [2019-01-07 18:20:41,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,335 INFO L273 TraceCheckUtils]: 4: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,337 INFO L273 TraceCheckUtils]: 3: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#(<= i 0)} assume i < n;a := a[i := 0];i := i + 1; {697#(forall ((r Int)) (or (< i (+ r 1)) (< r 0) (= 0 (select a r))))} is VALID [2019-01-07 18:20:41,349 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} i := 0;assume j == i; {658#(<= i 0)} is VALID [2019-01-07 18:20:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 18:20:41,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:20:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-01-07 18:20:41,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:20:41,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-01-07 18:20:41,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:20:41,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2019-01-07 18:20:48,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2019-01-07 18:20:48,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 18:20:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 18:20:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=309, Unknown=3, NotChecked=0, Total=420 [2019-01-07 18:20:48,074 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-01-07 18:21:08,652 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 18:21:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 18:21:08,654 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.checkEquivalence(SimplifyDDAWithTimeout.java:132) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 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) ... 44 more [2019-01-07 18:21:08,659 INFO L168 Benchmark]: Toolchain (without parser) took 122301.63 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 971.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -516.7 MB). Peak memory consumption was 454.8 MB. Max. memory is 7.1 GB. [2019-01-07 18:21:08,660 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:21:08,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:21:08,661 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:21:08,661 INFO L168 Benchmark]: RCFGBuilder took 354.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 18:21:08,661 INFO L168 Benchmark]: TraceAbstraction took 121876.81 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 971.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -537.8 MB). Peak memory consumption was 433.7 MB. Max. memory is 7.1 GB. [2019-01-07 18:21:08,664 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 354.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121876.81 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 971.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -537.8 MB). Peak memory consumption was 433.7 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...