java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:29:28,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:29:28,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:29:28,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:29:28,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:29:28,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:29:28,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:29:28,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:29:28,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:29:28,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:29:28,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:29:28,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:29:28,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:29:28,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:29:28,380 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:29:28,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:29:28,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:29:28,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:29:28,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:29:28,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:29:28,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:29:28,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:29:28,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:29:28,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:29:28,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:29:28,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:29:28,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:29:28,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:29:28,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:29:28,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:29:28,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:29:28,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:29:28,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:29:28,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:29:28,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:29:28,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:29:28,400 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-19 12:29:28,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:29:28,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:29:28,414 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:29:28,414 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:29:28,414 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:29:28,415 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:29:28,415 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:29:28,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:29:28,415 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:29:28,415 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-19 12:29:28,416 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-19 12:29:28,416 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:29:28,416 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:29:28,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:29:28,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:29:28,417 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:29:28,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:29:28,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:29:28,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:29:28,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:29:28,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:29:28,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:29:28,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:29:28,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:29:28,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:29:28,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:29:28,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:29:28,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:29:28,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:29:28,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:29:28,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:29:28,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:29:28,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:29:28,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:29:28,421 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:29:28,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:29:28,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:29:28,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:29:28,422 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:29:28,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:29:28,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:29:28,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:29:28,468 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:29:28,469 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:29:28,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2018-12-19 12:29:28,470 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2018-12-19 12:29:28,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:29:28,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:29:28,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:29:28,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:29:28,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:29:28,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,538 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-19 12:29:28,539 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-19 12:29:28,539 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-19 12:29:28,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:29:28,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:29:28,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:29:28,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:29:28,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... [2018-12-19 12:29:28,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:29:28,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:29:28,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:29:28,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:29:28,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:29:28,638 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-19 12:29:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-19 12:29:28,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-19 12:29:29,014 INFO L272 CfgBuilder]: Using library mode [2018-12-19 12:29:29,014 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-19 12:29:29,015 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:29:29 BoogieIcfgContainer [2018-12-19 12:29:29,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:29:29,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:29:29,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:29:29,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:29:29,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:29:28" (1/2) ... [2018-12-19 12:29:29,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30332fb7 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:29:29, skipping insertion in model container [2018-12-19 12:29:29,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:29:29" (2/2) ... [2018-12-19 12:29:29,024 INFO L112 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bpl [2018-12-19 12:29:29,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:29:29,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-19 12:29:29,062 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-19 12:29:29,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:29:29,099 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:29:29,100 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:29:29,100 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:29:29,100 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:29:29,100 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:29:29,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:29:29,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:29:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-19 12:29:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:29:29,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:29:29,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:29:29,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:29:29,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:29:29,140 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-19 12:29:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:29:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:29:29,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:29:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:29:29,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:29:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:29:29,328 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} assume end >= 0;a := a[end := 42];i := 0; {11#(<= i end)} is VALID [2018-12-19 12:29:29,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= i end)} assume !(a[i] != 42); {11#(<= i end)} is VALID [2018-12-19 12:29:29,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#(<= i end)} assume !(i <= end); {10#false} is VALID [2018-12-19 12:29:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:29:29,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:29:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:29:29,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:29:29,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-19 12:29:29,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:29:29,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:29:29,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:29:29,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:29:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:29:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:29:29,481 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-19 12:29:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:29:29,591 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-19 12:29:29,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:29:29,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-19 12:29:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:29:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:29:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-19 12:29:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:29:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-19 12:29:29,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2018-12-19 12:29:29,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:29:29,672 INFO L225 Difference]: With dead ends: 9 [2018-12-19 12:29:29,673 INFO L226 Difference]: Without dead ends: 5 [2018-12-19 12:29:29,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:29:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-19 12:29:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-19 12:29:29,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:29:29,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-19 12:29:29,744 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-19 12:29:29,744 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-19 12:29:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:29:29,746 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-19 12:29:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:29:29,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:29:29,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:29:29,747 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-19 12:29:29,747 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-19 12:29:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:29:29,749 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-19 12:29:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:29:29,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:29:29,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:29:29,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:29:29,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:29:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:29:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-19 12:29:29,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-19 12:29:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:29:29,753 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-19 12:29:29,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:29:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:29:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:29:29,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:29:29,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:29:29,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:29:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:29:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-19 12:29:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:29:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:29:29,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:29:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:29:29,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:29:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:29:30,214 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-19 12:29:30,391 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} assume end >= 0;a := a[end := 42];i := 0; {44#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} is VALID [2018-12-19 12:29:30,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} assume a[i] != 42;i := i + 1; {45#(<= i end)} is VALID [2018-12-19 12:29:30,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#(<= i end)} assume !(a[i] != 42); {45#(<= i end)} is VALID [2018-12-19 12:29:30,401 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#(<= i end)} assume !(i <= end); {43#false} is VALID [2018-12-19 12:29:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:29:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:29:30,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:29:30,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:29:30,405 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-19 12:29:30,457 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:29:30,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:29:44,864 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-19 12:29:44,865 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-19 12:29:44,865 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:29:44,866 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:29:44,867 WARN L224 ngHoareTripleChecker]: Pre: {2147483625#(or (exists ((v_v_184_1 Int) (v_b_14_1 Int) (v_b_16_1 Int)) (and (<= (- c_i (- c_i)) 2) (<= (- (- v_b_16_1) v_v_184_1) (- 43)) (<= (- (- c_i) v_v_184_1) (- 42)) (<= (- v_b_14_1 v_b_16_1) (- 1)) (<= (- (- c_end) (- v_v_184_1)) 42) (<= (- c_i v_v_184_1) (- 41)) (<= (- (- c_end) (- c_i)) 1) (<= (- v_b_16_1 (- c_i)) 3) (<= (- (- v_b_14_1) v_b_16_1) (- 1)) (<= (- v_b_16_1 c_i) 1) (<= (- v_b_16_1 v_v_184_1) (- 40)) (<= (- v_b_14_1 (- v_v_184_1)) 43) (<= (- (- c_i) (- v_v_184_1)) 42) (<= (- v_b_14_1 v_v_184_1) (- 41)) (<= (- (- v_b_14_1) c_i) 0) (<= (- (- v_b_16_1) c_i) (- 1)) (forall ((v_idx_69 Int) (v_idx_70 Int) (v_idx_71 Int)) (or (< v_idx_71 v_b_16_1) (<= v_b_14_1 v_idx_69) (<= v_b_16_1 v_idx_70) (< v_idx_70 v_b_14_1) (and (<= (- (- v_b_16_1) (select c_a v_idx_70)) (- 43)) (<= (- (- c_i) (select c_a v_idx_70)) (- 42)) (<= (- c_i (- (select c_a v_idx_70))) 43) (<= (- (- c_end) (- (select c_a v_idx_70))) 42) (<= (- c_i (select c_a v_idx_70)) (- 41)) (<= (- (- c_end) (select c_a v_idx_70)) (- 42)) (<= (- v_b_16_1 (select c_a v_idx_70)) (- 40)) (<= (- v_b_14_1 (- (select c_a v_idx_70))) 43) (<= (- (- c_i) (- (select c_a v_idx_70))) 42) (<= (- v_b_14_1 (select c_a v_idx_70)) (- 41)) (<= (- (- v_b_14_1) (select c_a v_idx_70)) (- 42)) (<= (- (- v_b_16_1) (- (select c_a v_idx_70))) 41) (<= (- v_b_16_1 (- (select c_a v_idx_70))) 44) (<= (- (- (select c_a v_idx_70)) (select c_a v_idx_70)) (- 84)) (<= (- (- v_b_14_1) (- (select c_a v_idx_70))) 42) (<= (- (select c_a v_idx_70) (- (select c_a v_idx_70))) 84)))) (<= (- v_b_14_1 (- v_b_14_1)) 2) (<= (- (- c_i) c_i) 0) (<= (- (- c_end) c_i) 0) (<= (- v_b_16_1 (- v_b_16_1)) 4) (<= (- (- v_b_14_1) (- c_i)) 0) (<= (- (- v_v_184_1) v_v_184_1) (- 84)) (<= (- (- v_b_14_1) (- v_v_184_1)) 42) (<= (- v_v_184_1 (- v_v_184_1)) 84) (<= (- (- c_end) c_end) 0) (<= (- c_i (- v_v_184_1)) 43) (<= (- (- c_end) v_v_184_1) (- 42)) (<= (- (- v_b_16_1) c_end) (- 1)) (<= (- (- v_b_14_1) (- v_b_16_1)) 1) (<= (- (- v_b_16_1) v_b_16_1) (- 2)) (<= (- v_b_14_1 c_end) 1) (<= (- (- v_b_16_1) (- c_i)) (- 1)) (<= (- v_b_14_1 c_i) 0) (<= (- v_b_14_1 (- c_i)) 2) (<= (- (- v_b_14_1) v_v_184_1) (- 42)) (<= (- (- v_b_14_1) c_end) 0) (<= (- (- v_b_16_1) (- v_v_184_1)) 41) (<= (- v_b_16_1 c_end) 2) (<= (- v_b_16_1 (- v_v_184_1)) 44) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- v_b_14_1 (- v_b_16_1)) 3))) (exists ((v_v_424_1 Int) (v_b_27_1 Int) (v_b_28_1 Int)) (and (<= (- v_b_27_1 (- v_b_27_1)) 4) (<= (- (- v_b_28_1) c_end) (- 1)) (<= (- v_b_28_1 v_v_424_1) (- 39)) (<= (- (- v_b_28_1) (- v_v_424_1)) 41) (<= (- v_v_424_1 (- v_v_424_1)) 84) (<= (- (- c_i) v_v_424_1) (- 42)) (<= (- v_b_28_1 (- v_b_28_1)) 6) (<= (- c_i (- c_i)) 4) (<= (- v_b_27_1 c_end) 2) (<= (- (- v_b_28_1) v_b_28_1) (- 2)) (<= (- (- v_b_27_1) c_i) 0) (<= (- (- v_b_27_1) v_b_28_1) (- 1)) (<= (- v_b_27_1 c_i) 0) (<= (- (- c_end) (- v_v_424_1)) 42) (<= (- v_b_27_1 (- v_b_28_1)) 5) (<= (- (- c_i) c_i) 0) (<= (- (- c_end) c_i) 0) (<= (- (- v_b_28_1) v_v_424_1) (- 43)) (<= (- v_b_27_1 (- c_i)) 4) (<= (- (- c_i) (- v_v_424_1)) 42) (<= (- v_b_28_1 (- v_v_424_1)) 45) (forall ((v_idx_74 Int) (v_idx_75 Int) (v_idx_73 Int)) (or (and (<= (- v_b_27_1 (select c_a v_idx_74)) (- 40)) (<= (- v_b_28_1 (select c_a v_idx_74)) (- 39)) (<= (- (- v_b_28_1) (- (select c_a v_idx_74))) 41) (<= (- v_b_27_1 (- (select c_a v_idx_74))) 44) (<= (- (- v_b_27_1) (- (select c_a v_idx_74))) 42) (<= (- (select c_a v_idx_74) (- (select c_a v_idx_74))) 84) (<= (- (- c_i) (select c_a v_idx_74)) (- 42)) (<= (- c_i (- (select c_a v_idx_74))) 44) (<= (- (- c_end) (select c_a v_idx_74)) (- 42)) (<= (- (- (select c_a v_idx_74)) (select c_a v_idx_74)) (- 84)) (<= (- c_i (select c_a v_idx_74)) (- 40)) (<= (- (- c_end) (- (select c_a v_idx_74))) 42) (<= (- (- v_b_28_1) (select c_a v_idx_74)) (- 43)) (<= (- (- c_i) (- (select c_a v_idx_74))) 42) (<= (- v_b_28_1 (- (select c_a v_idx_74))) 45) (<= (- (- v_b_27_1) (select c_a v_idx_74)) (- 42))) (< v_idx_74 v_b_27_1) (<= v_b_27_1 v_idx_73) (< v_idx_75 v_b_28_1) (<= v_b_28_1 v_idx_74))) (<= (- (- v_b_27_1) v_v_424_1) (- 42)) (<= (- v_b_27_1 v_v_424_1) (- 40)) (<= (- (- c_end) c_end) 0) (<= (- (- v_b_27_1) (- v_b_28_1)) 1) (<= (- v_b_27_1 (- v_v_424_1)) 44) (<= (- v_b_28_1 (- c_i)) 5) (<= (- (- v_b_27_1) (- v_v_424_1)) 42) (<= (- (- v_b_27_1) v_b_27_1) 0) (<= (- v_b_28_1 c_i) 1) (<= (- (- c_end) (- c_i)) 2) (<= (- (- v_b_27_1) c_end) 0) (<= (- v_b_28_1 c_end) 3) (<= (- (- v_b_28_1) c_i) (- 1)) (<= (- c_i (- v_v_424_1)) 44) (<= (- (- c_end) v_v_424_1) (- 42)) (<= (- (- v_v_424_1) v_v_424_1) (- 84)) (<= (- v_b_27_1 v_b_28_1) (- 1)) (<= (- c_i v_v_424_1) (- 40)) (<= (- (- v_b_28_1) (- c_i)) (- 1)) (<= (- (- v_b_27_1) (- c_i)) 0))))} [2018-12-19 12:29:44,867 WARN L228 ngHoareTripleChecker]: Action: assume !(i <= end); [2018-12-19 12:29:44,868 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_i c_end)) [2018-12-19 12:29:44,868 WARN L230 ngHoareTripleChecker]: Post: {2147483624#(exists ((v_v_424_1 Int) (v_b_27_1 Int) (v_b_28_1 Int)) (and (<= (- v_b_27_1 (- v_b_27_1)) 4) (<= (- (- c_i) (- v_v_424_1)) 41) (<= (- v_b_28_1 v_v_424_1) (- 39)) (<= (- v_v_424_1 (- v_v_424_1)) 84) (<= (- (- v_b_27_1) v_b_28_1) (- 3)) (<= (- v_b_28_1 (- v_b_28_1)) 6) (<= (- v_b_27_1 c_end) 2) (<= (- (- c_i) c_i) (- 2)) (<= (- (- v_b_27_1) (- c_end)) (- 1)) (<= (- (- c_end) (- v_v_424_1)) 42) (<= (- c_end (- v_v_424_1)) 43) (<= (- (- v_b_27_1) v_b_27_1) (- 2)) (<= (- c_end (- c_i)) 3) (<= (- v_b_28_1 (- v_v_424_1)) 45) (<= (- (- c_i) v_v_424_1) (- 43)) (<= (- (- v_b_27_1) (- v_v_424_1)) 41) (<= (- v_b_27_1 (- v_v_424_1)) 44) (<= (- (- v_b_28_1) v_v_424_1) (- 44)) (<= (- v_b_28_1 c_i) 1) (<= (- (- c_end) (- c_i)) 2) (<= (- (- c_end) v_v_424_1) (- 42)) (<= (- (- v_v_424_1) v_v_424_1) (- 84)) (<= (- v_b_27_1 v_b_28_1) (- 1)) (<= (- c_i v_v_424_1) (- 40)) (<= (- c_end v_v_424_1) (- 41)) (<= (- (- v_b_28_1) c_end) (- 2)) (forall ((v_idx_78 Int) (v_idx_79 Int) (v_idx_77 Int)) (or (< v_idx_78 v_b_27_1) (<= v_b_27_1 v_idx_77) (<= v_b_28_1 v_idx_78) (and (<= (- (- v_b_27_1) (- (select c_a v_idx_78))) 41) (<= (- v_b_27_1 (select c_a v_idx_78)) (- 40)) (<= (- (- c_i) (- (select c_a v_idx_78))) 41) (<= (- v_b_28_1 (select c_a v_idx_78)) (- 39)) (<= (- v_b_27_1 (- (select c_a v_idx_78))) 44) (<= (- (select c_a v_idx_78) (- (select c_a v_idx_78))) 84) (<= (- (- v_b_28_1) (select c_a v_idx_78)) (- 44)) (<= (- c_i (- (select c_a v_idx_78))) 44) (<= (- (- c_end) (select c_a v_idx_78)) (- 42)) (<= (- (- (select c_a v_idx_78)) (select c_a v_idx_78)) (- 84)) (<= (- c_i (select c_a v_idx_78)) (- 40)) (<= (- (- c_end) (- (select c_a v_idx_78))) 42) (<= (- c_end (- (select c_a v_idx_78))) 43) (<= (- c_end (select c_a v_idx_78)) (- 41)) (<= (- v_b_28_1 (- (select c_a v_idx_78))) 45) (<= (- (- v_b_27_1) (select c_a v_idx_78)) (- 43)) (<= (- (- c_i) (select c_a v_idx_78)) (- 43)) (<= (- (- v_b_28_1) (- (select c_a v_idx_78))) 40)) (< v_idx_79 v_b_28_1))) (<= (- c_i (- c_i)) 4) (<= (- c_end c_i) (- 1)) (<= (- v_b_28_1 (- c_end)) 4) (<= (- v_b_27_1 c_i) 0) (<= (- (- v_b_27_1) c_i) (- 2)) (<= (- v_b_27_1 (- v_b_28_1)) 5) (<= (- (- v_b_28_1) (- c_end)) (- 2)) (<= (- v_b_27_1 (- c_i)) 4) (<= (- (- v_b_27_1) c_end) (- 1)) (<= (- (- v_b_28_1) v_b_28_1) (- 4)) (<= (- (- v_b_28_1) (- v_v_424_1)) 40) (<= (- v_b_27_1 v_v_424_1) (- 40)) (<= (- (- c_end) c_end) 0) (<= (- (- v_b_27_1) (- v_b_28_1)) 1) (<= (- v_b_27_1 (- c_end)) 3) (<= (- v_b_28_1 (- c_i)) 5) (<= (- c_end (- c_end)) 2) (<= (- (- c_end) c_i) (- 1)) (<= (- v_b_28_1 c_end) 3) (<= (- c_i (- v_v_424_1)) 44) (<= (- (- v_b_28_1) c_i) (- 3)) (<= (- (- v_b_28_1) (- c_i)) (- 1)) (<= (- (- v_b_27_1) (- c_i)) 0) (<= (- (- v_b_27_1) v_v_424_1) (- 43))))} [2018-12-19 12:29:44,868 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:29:44,886 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:29:44,886 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:29:46,595 WARN L181 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 287 DAG size of output: 158 [2018-12-19 12:29:46,596 WARN L270 ngHoareTripleChecker]: Pre: {2147483625#(exists ((v_v_424_1 Int) (v_b_27_1 Int) (v_b_28_1 Int)) (and (<= (- v_b_27_1 (- v_b_27_1)) 4) (<= (- (- v_b_28_1) end) (- 1)) (<= (- v_b_28_1 v_v_424_1) (- 39)) (<= (- (- v_b_28_1) (- v_v_424_1)) 41) (<= (- v_v_424_1 (- v_v_424_1)) 84) (<= (- (- i) v_v_424_1) (- 42)) (<= (- v_b_28_1 (- v_b_28_1)) 6) (<= (- i (- i)) 4) (<= (- v_b_27_1 end) 2) (<= (- (- v_b_28_1) v_b_28_1) (- 2)) (<= (- (- v_b_27_1) i) 0) (<= (- (- v_b_27_1) v_b_28_1) (- 1)) (<= (- v_b_27_1 i) 0) (<= (- (- end) (- v_v_424_1)) 42) (<= (- v_b_27_1 (- v_b_28_1)) 5) (<= (- (- i) i) 0) (<= (- (- end) i) 0) (<= (- (- v_b_28_1) v_v_424_1) (- 43)) (<= (- v_b_27_1 (- i)) 4) (<= (- (- i) (- v_v_424_1)) 42) (<= (- v_b_28_1 (- v_v_424_1)) 45) (forall ((v_idx_74 Int) (v_idx_75 Int) (v_idx_73 Int)) (or (and (<= (- v_b_27_1 (select a v_idx_74)) (- 40)) (<= (- v_b_28_1 (select a v_idx_74)) (- 39)) (<= (- (- v_b_28_1) (- (select a v_idx_74))) 41) (<= (- v_b_27_1 (- (select a v_idx_74))) 44) (<= (- (- v_b_27_1) (- (select a v_idx_74))) 42) (<= (- (select a v_idx_74) (- (select a v_idx_74))) 84) (<= (- (- i) (select a v_idx_74)) (- 42)) (<= (- i (- (select a v_idx_74))) 44) (<= (- (- end) (select a v_idx_74)) (- 42)) (<= (- (- (select a v_idx_74)) (select a v_idx_74)) (- 84)) (<= (- i (select a v_idx_74)) (- 40)) (<= (- (- end) (- (select a v_idx_74))) 42) (<= (- (- v_b_28_1) (select a v_idx_74)) (- 43)) (<= (- (- i) (- (select a v_idx_74))) 42) (<= (- v_b_28_1 (- (select a v_idx_74))) 45) (<= (- (- v_b_27_1) (select a v_idx_74)) (- 42))) (< v_idx_74 v_b_27_1) (<= v_b_27_1 v_idx_73) (< v_idx_75 v_b_28_1) (<= v_b_28_1 v_idx_74))) (<= (- (- v_b_27_1) v_v_424_1) (- 42)) (<= (- v_b_27_1 v_v_424_1) (- 40)) (<= (- (- end) end) 0) (<= (- (- v_b_27_1) (- v_b_28_1)) 1) (<= (- v_b_27_1 (- v_v_424_1)) 44) (<= (- v_b_28_1 (- i)) 5) (<= (- (- v_b_27_1) (- v_v_424_1)) 42) (<= (- (- v_b_27_1) v_b_27_1) 0) (<= (- v_b_28_1 i) 1) (<= (- (- end) (- i)) 2) (<= (- (- v_b_27_1) end) 0) (<= (- v_b_28_1 end) 3) (<= (- (- v_b_28_1) i) (- 1)) (<= (- i (- v_v_424_1)) 44) (<= (- (- end) v_v_424_1) (- 42)) (<= (- (- v_v_424_1) v_v_424_1) (- 84)) (<= (- v_b_27_1 v_b_28_1) (- 1)) (<= (- i v_v_424_1) (- 40)) (<= (- (- v_b_28_1) (- i)) (- 1)) (<= (- (- v_b_27_1) (- i)) 0)))} [2018-12-19 12:29:46,596 WARN L274 ngHoareTripleChecker]: Action: assume !(i <= end); [2018-12-19 12:29:46,599 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_i c_end)) [2018-12-19 12:29:49,487 WARN L276 ngHoareTripleChecker]: Post: {2147483624#(and (<= 0 end) (<= 1 (+ end i)) (<= (- (- end) end) 0) (<= end 1) (<= 1 i) (<= (- (- end) (- i)) 2) (<= (* 2 end) 2) (<= (- i (- i)) 4) (<= (- end (- end)) 2) (<= (- (- end) i) (- 1)) (<= (- end i) (- 1)) (<= (- (- i) i) (- 2)) (exists ((v_b_27_1 Int) (v_b_28_1 Int)) (and (<= (* 2 v_b_27_1) 4) (<= (- v_b_27_1 (- v_b_27_1)) 4) (<= v_b_28_1 3) (forall ((v_idx_78 Int)) (or (<= (- (- v_b_28_1) (- (select a v_idx_78))) 40) (< v_idx_78 v_b_27_1) (<= v_b_28_1 v_idx_78))) (<= (- (- v_b_27_1) v_b_28_1) (- 3)) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 v_b_27_1) (<= (- i (select a v_prenex_11)) (- 40)) (<= v_b_28_1 v_prenex_11))) (<= 3 (+ i v_b_28_1)) (<= (* 2 v_b_28_1) 6) (forall ((v_prenex_16 Int)) (or (<= v_b_28_1 v_prenex_16) (< v_prenex_16 v_b_27_1) (<= (- (- i) (- (select a v_prenex_16))) 41))) (<= (- v_b_28_1 (- v_b_28_1)) 6) (<= (- v_b_27_1 end) 2) (<= (- (- v_b_27_1) (- end)) (- 1)) (<= (+ v_b_28_1 i) 5) (<= (+ v_b_27_1 v_b_28_1) 5) (<= v_b_28_1 (+ i 2)) (<= (- (- v_b_27_1) v_b_27_1) (- 2)) (<= (+ end 1) v_b_28_1) (<= 4 (* 2 v_b_28_1)) (<= (+ v_b_27_1 i) 4) (<= 2 (* 2 v_b_27_1)) (forall ((v_prenex_15 Int)) (or (<= v_b_28_1 v_prenex_15) (< v_prenex_15 v_b_27_1) (<= (- (- (select a v_prenex_15)) (select a v_prenex_15)) (- 84)))) (forall ((v_prenex_12 Int)) (or (< v_prenex_12 v_b_27_1) (<= (- (- v_b_27_1) (select a v_prenex_12)) (- 43)) (<= v_b_28_1 v_prenex_12))) (forall ((v_prenex_2 Int)) (or (< v_prenex_2 v_b_27_1) (<= v_b_28_1 v_prenex_2) (<= (- v_b_28_1 (- (select a v_prenex_2))) 45))) (forall ((v_prenex_5 Int)) (or (<= (- i (- (select a v_prenex_5))) 44) (< v_prenex_5 v_b_27_1) (<= v_b_28_1 v_prenex_5))) (<= v_b_27_1 2) (<= (- v_b_28_1 i) 1) (forall ((v_prenex_4 Int)) (or (< v_prenex_4 v_b_27_1) (<= v_b_28_1 v_prenex_4) (<= (- (- v_b_28_1) (select a v_prenex_4)) (- 44)))) (<= v_b_28_1 (+ end 3)) (forall ((v_prenex_9 Int)) (or (<= v_b_28_1 v_prenex_9) (< v_prenex_9 v_b_27_1) (<= (- end (select a v_prenex_9)) (- 41)))) (<= (- v_b_27_1 v_b_28_1) (- 1)) (<= i v_b_28_1) (forall ((v_prenex_7 Int)) (or (< v_prenex_7 v_b_27_1) (<= (- (- i) (select a v_prenex_7)) (- 43)) (<= v_b_28_1 v_prenex_7))) (<= 2 (+ v_b_27_1 i)) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 v_b_27_1) (<= v_b_28_1 v_prenex_10) (<= (- (- v_b_27_1) (- (select a v_prenex_10))) 41))) (forall ((v_prenex_14 Int)) (or (<= v_b_28_1 v_prenex_14) (<= (- v_b_28_1 (select a v_prenex_14)) (- 39)) (< v_prenex_14 v_b_27_1))) (forall ((v_prenex_13 Int)) (or (< v_prenex_13 v_b_27_1) (<= v_b_28_1 v_prenex_13) (<= (- v_b_27_1 (- (select a v_prenex_13))) 44))) (<= (- (- v_b_28_1) end) (- 2)) (forall ((v_prenex_6 Int)) (or (< v_prenex_6 v_b_27_1) (<= (- (- end) (- (select a v_prenex_6))) 42) (<= v_b_28_1 v_prenex_6))) (<= v_b_27_1 (+ end 2)) (forall ((v_prenex_1 Int)) (or (<= v_b_28_1 v_prenex_1) (<= (- v_b_27_1 (select a v_prenex_1)) (- 40)) (< v_prenex_1 v_b_27_1))) (<= v_b_28_1 (+ v_b_27_1 2)) (<= (- v_b_28_1 (- end)) 4) (<= (- v_b_27_1 i) 0) (<= (- (- v_b_27_1) i) (- 2)) (forall ((v_prenex_3 Int)) (or (< v_prenex_3 v_b_27_1) (<= v_b_28_1 v_prenex_3) (<= (- (select a v_prenex_3) (- (select a v_prenex_3))) 84))) (forall ((v_prenex_17 Int)) (or (<= v_b_28_1 v_prenex_17) (< v_prenex_17 v_b_27_1) (<= (- end (- (select a v_prenex_17))) 43))) (<= (- v_b_27_1 (- v_b_28_1)) 5) (<= (- (- v_b_28_1) (- end)) (- 2)) (<= end v_b_27_1) (<= (+ end v_b_28_1) 4) (<= i (+ v_b_27_1 1)) (<= 1 (+ v_b_27_1 end)) (<= (- v_b_27_1 (- i)) 4) (<= (- (- v_b_27_1) end) (- 1)) (<= (+ v_b_27_1 end) 3) (<= (- (- v_b_28_1) v_b_28_1) (- 4)) (<= 1 (+ end v_b_27_1)) (<= 1 v_b_27_1) (<= (- (- v_b_27_1) (- v_b_28_1)) 1) (<= (- v_b_27_1 (- end)) 3) (<= 3 (+ v_b_27_1 v_b_28_1)) (<= (- v_b_28_1 (- i)) 5) (<= 2 v_b_28_1) (<= (+ end v_b_27_1) 3) (<= (- v_b_28_1 end) 3) (<= 2 (+ end v_b_28_1)) (forall ((v_prenex_8 Int)) (or (< v_prenex_8 v_b_27_1) (<= v_b_28_1 v_prenex_8) (<= (- (- end) (select a v_prenex_8)) (- 42)))) (<= (+ i v_b_28_1) 5) (<= (- (- v_b_28_1) i) (- 3)) (<= v_b_27_1 (+ i 1)) (<= v_b_27_1 v_b_28_1) (<= 3 (+ v_b_28_1 i)) (<= (- (- v_b_28_1) (- i)) (- 1)) (<= (- (- v_b_27_1) (- i)) 0))) (<= i (+ end 2)) (<= end i) (<= (+ end i) 3) (<= i 2) (<= 2 (* 2 i)) (<= (- end (- i)) 3) (<= (* 2 i) 4) (<= 0 (* 2 end)))} [2018-12-19 12:29:55,448 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-19 12:29:55,449 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-19 12:29:55,449 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:29:55,450 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:29:55,450 WARN L224 ngHoareTripleChecker]: Pre: {2147483613#(or (exists ((v_b_43_1 Int) (v_b_44_1 Int) (v_v_645_1 Int)) (and (<= (- v_b_44_1 c_end) 43) (<= (- (- c_i) v_v_645_1) (- 42)) (<= (- v_b_44_1 v_v_645_1) 1) (<= (- (- c_end) (- v_v_645_1)) 42) (<= (- v_b_43_1 c_i) 0) (<= (- (- v_b_43_1) v_b_44_1) (- 1)) (<= (- v_b_43_1 c_end) 42) (<= (- (- v_b_43_1) (- c_i)) 0) (<= (- v_b_43_1 (- v_b_44_1)) 85) (<= (- v_v_645_1 (- v_v_645_1)) 84) (<= (- (- c_end) v_v_645_1) (- 42)) (<= (- c_i (- v_v_645_1)) 84) (<= (- v_b_43_1 (- v_v_645_1)) 84) (<= (- (- v_b_43_1) (- v_v_645_1)) 42) (<= (- (- v_b_44_1) c_i) (- 1)) (<= (- (- v_b_44_1) (- c_i)) (- 1)) (<= (- (- c_i) c_i) 0) (<= (- (- c_end) c_i) 0) (<= (- v_b_43_1 v_v_645_1) 0) (<= (- (- v_b_44_1) v_v_645_1) (- 43)) (<= (- v_b_43_1 v_b_44_1) (- 1)) (<= (- (- v_b_44_1) (- v_v_645_1)) 41) (<= (- (- v_v_645_1) v_v_645_1) (- 84)) (<= (- v_b_44_1 (- v_v_645_1)) 85) (<= (- (- v_b_43_1) v_b_43_1) 0) (<= (- (- c_end) c_end) 0) (<= (- (- v_b_44_1) c_end) (- 1)) (<= (- v_b_44_1 c_i) 1) (<= (- (- v_b_43_1) (- v_b_44_1)) 1) (<= (- v_b_43_1 (- v_b_43_1)) 84) (forall ((v_idx_105 Int) (v_idx_106 Int) (v_idx_107 Int)) (or (<= v_b_43_1 v_idx_105) (< v_idx_106 v_b_43_1) (<= v_b_44_1 v_idx_106) (and (<= (- v_b_44_1 (- (select c_a v_idx_106))) 85) (<= (- (- c_i) (select c_a v_idx_106)) (- 42)) (<= (- v_b_44_1 (select c_a v_idx_106)) 1) (<= (- (- c_end) (- (select c_a v_idx_106))) 42) (<= (- c_i (select c_a v_idx_106)) 0) (<= (- (select c_a v_idx_106) (- (select c_a v_idx_106))) 84) (<= (- (- c_end) (select c_a v_idx_106)) (- 42)) (<= (- c_i (- (select c_a v_idx_106))) 84) (<= (- v_b_43_1 (- (select c_a v_idx_106))) 84) (<= (- (- v_b_43_1) (- (select c_a v_idx_106))) 42) (<= (- (- v_b_43_1) (select c_a v_idx_106)) (- 42)) (<= (- v_b_43_1 (select c_a v_idx_106)) 0) (<= (- (- v_b_44_1) (select c_a v_idx_106)) (- 43)) (<= (- (- v_b_44_1) (- (select c_a v_idx_106))) 41) (<= (- (- (select c_a v_idx_106)) (select c_a v_idx_106)) (- 84)) (<= (- (- c_i) (- (select c_a v_idx_106))) 42)) (< v_idx_107 v_b_44_1))) (<= (- v_b_44_1 (- v_b_44_1)) 86) (<= (- v_b_44_1 (- c_i)) 85) (<= (- c_i v_v_645_1) 0) (<= (- (- c_end) (- c_i)) 42) (<= (- (- v_b_43_1) c_end) 0) (<= (- v_b_43_1 (- c_i)) 84) (<= (- (- v_b_44_1) v_b_44_1) (- 2)) (<= (- c_i (- c_i)) 84) (<= (- (- v_b_43_1) v_v_645_1) (- 42)) (<= (- (- v_b_43_1) c_i) 0) (<= (- (- c_i) (- v_v_645_1)) 42))) (exists ((v_v_184_1 Int) (v_b_14_1 Int) (v_b_16_1 Int)) (and (<= (- c_i (- c_i)) 2) (<= (- (- v_b_16_1) v_v_184_1) (- 43)) (<= (- (- c_i) v_v_184_1) (- 42)) (<= (- v_b_14_1 v_b_16_1) (- 1)) (<= (- (- c_end) (- v_v_184_1)) 42) (<= (- c_i v_v_184_1) (- 41)) (<= (- (- c_end) (- c_i)) 1) (<= (- v_b_16_1 (- c_i)) 3) (<= (- (- v_b_14_1) v_b_16_1) (- 1)) (<= (- v_b_16_1 c_i) 1) (<= (- v_b_16_1 v_v_184_1) (- 40)) (<= (- v_b_14_1 (- v_v_184_1)) 43) (<= (- (- c_i) (- v_v_184_1)) 42) (<= (- v_b_14_1 v_v_184_1) (- 41)) (<= (- (- v_b_14_1) c_i) 0) (<= (- (- v_b_16_1) c_i) (- 1)) (<= (- v_b_14_1 (- v_b_14_1)) 2) (<= (- (- c_i) c_i) 0) (<= (- (- c_end) c_i) 0) (<= (- v_b_16_1 (- v_b_16_1)) 4) (<= (- (- v_b_14_1) (- c_i)) 0) (<= (- (- v_v_184_1) v_v_184_1) (- 84)) (<= (- (- v_b_14_1) (- v_v_184_1)) 42) (<= (- v_v_184_1 (- v_v_184_1)) 84) (<= (- (- c_end) c_end) 0) (<= (- c_i (- v_v_184_1)) 43) (<= (- (- c_end) v_v_184_1) (- 42)) (<= (- (- v_b_16_1) c_end) (- 1)) (<= (- (- v_b_14_1) (- v_b_16_1)) 1) (<= (- (- v_b_16_1) v_b_16_1) (- 2)) (<= (- v_b_14_1 c_end) 1) (<= (- (- v_b_16_1) (- c_i)) (- 1)) (<= (- v_b_14_1 c_i) 0) (<= (- v_b_14_1 (- c_i)) 2) (<= (- (- v_b_14_1) v_v_184_1) (- 42)) (forall ((v_idx_102 Int) (v_idx_103 Int) (v_idx_101 Int)) (or (< v_idx_103 v_b_16_1) (<= v_b_14_1 v_idx_101) (and (<= (- (- v_b_16_1) (select c_a v_idx_102)) (- 43)) (<= (- (- c_i) (select c_a v_idx_102)) (- 42)) (<= (- c_i (- (select c_a v_idx_102))) 43) (<= (- (- c_end) (- (select c_a v_idx_102))) 42) (<= (- c_i (select c_a v_idx_102)) (- 41)) (<= (- (- c_end) (select c_a v_idx_102)) (- 42)) (<= (- v_b_16_1 (select c_a v_idx_102)) (- 40)) (<= (- v_b_14_1 (- (select c_a v_idx_102))) 43) (<= (- (- c_i) (- (select c_a v_idx_102))) 42) (<= (- v_b_14_1 (select c_a v_idx_102)) (- 41)) (<= (- (- v_b_14_1) (select c_a v_idx_102)) (- 42)) (<= (- (- v_b_16_1) (- (select c_a v_idx_102))) 41) (<= (- v_b_16_1 (- (select c_a v_idx_102))) 44) (<= (- (- (select c_a v_idx_102)) (select c_a v_idx_102)) (- 84)) (<= (- (- v_b_14_1) (- (select c_a v_idx_102))) 42) (<= (- (select c_a v_idx_102) (- (select c_a v_idx_102))) 84)) (< v_idx_102 v_b_14_1) (<= v_b_16_1 v_idx_102))) (<= (- (- v_b_14_1) c_end) 0) (<= (- (- v_b_16_1) (- v_v_184_1)) 41) (<= (- v_b_16_1 c_end) 2) (<= (- v_b_16_1 (- v_v_184_1)) 44) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- v_b_14_1 (- v_b_16_1)) 3))))} [2018-12-19 12:29:55,450 WARN L228 ngHoareTripleChecker]: Action: assume !(i <= end); [2018-12-19 12:29:55,450 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_i c_end)) [2018-12-19 12:29:55,451 WARN L230 ngHoareTripleChecker]: Post: {2147483612#(exists ((v_b_43_1 Int) (v_b_44_1 Int) (v_v_645_1 Int)) (and (<= (- v_b_44_1 c_end) 43) (<= (- (- v_b_44_1) (- v_v_645_1)) 40) (<= (- (- v_b_44_1) c_end) (- 2)) (<= (- v_b_43_1 c_i) 0) (<= (- v_b_43_1 c_end) 42) (<= (- (- v_b_43_1) (- c_i)) 0) (<= (- (- v_b_44_1) v_b_44_1) (- 4)) (<= (- (- c_i) c_i) (- 2)) (<= (- v_v_645_1 (- v_v_645_1)) 84) (<= (- (- v_b_43_1) (- v_v_645_1)) 41) (<= (- v_b_43_1 (- v_v_645_1)) 84) (<= (- (- v_b_44_1) (- c_i)) (- 1)) (<= (- (- v_b_43_1) c_end) (- 1)) (<= (- (- c_i) (- v_v_645_1)) 41) (<= (- v_b_43_1 v_v_645_1) 0) (<= (- (- v_v_645_1) v_v_645_1) (- 84)) (<= (- v_b_44_1 (- c_end)) 84) (<= (- (- v_b_43_1) (- v_b_44_1)) 1) (<= (- (- v_b_43_1) (- c_end)) (- 1)) (<= (- v_b_44_1 (- v_b_44_1)) 86) (<= (- v_b_44_1 (- c_i)) 85) (<= (- c_i v_v_645_1) 0) (<= (- (- v_b_44_1) c_i) (- 3)) (<= (- (- c_end) (- c_i)) 42) (<= (- (- v_b_44_1) (- c_end)) (- 2)) (<= (- c_end (- v_v_645_1)) 83) (<= (- v_b_44_1 v_v_645_1) 1) (<= (- (- c_end) (- v_v_645_1)) 42) (<= (- (- v_b_43_1) v_v_645_1) (- 43)) (<= (- v_b_43_1 (- c_end)) 83) (<= (- c_end c_i) (- 1)) (<= (- v_b_43_1 (- v_b_44_1)) 85) (<= (- (- c_end) v_v_645_1) (- 42)) (<= (- c_i (- v_v_645_1)) 84) (<= (- (- v_b_43_1) v_b_43_1) (- 2)) (<= (- (- v_b_44_1) v_v_645_1) (- 44)) (<= (- v_b_43_1 v_b_44_1) (- 1)) (<= (- c_end v_v_645_1) (- 1)) (<= (- v_b_44_1 (- v_v_645_1)) 85) (forall ((v_idx_109 Int) (v_idx_111 Int) (v_idx_110 Int)) (or (< v_idx_111 v_b_44_1) (<= v_b_43_1 v_idx_109) (<= v_b_44_1 v_idx_110) (< v_idx_110 v_b_43_1) (and (<= (- v_b_44_1 (- (select c_a v_idx_110))) 85) (<= (- (- v_b_44_1) (- (select c_a v_idx_110))) 40) (<= (- c_end (- (select c_a v_idx_110))) 83) (<= (- v_b_44_1 (select c_a v_idx_110)) 1) (<= (- (- c_end) (- (select c_a v_idx_110))) 42) (<= (- (- v_b_43_1) (select c_a v_idx_110)) (- 43)) (<= (- c_i (select c_a v_idx_110)) 0) (<= (- (select c_a v_idx_110) (- (select c_a v_idx_110))) 84) (<= (- (- v_b_43_1) (- (select c_a v_idx_110))) 41) (<= (- (- c_end) (select c_a v_idx_110)) (- 42)) (<= (- c_i (- (select c_a v_idx_110))) 84) (<= (- v_b_43_1 (- (select c_a v_idx_110))) 84) (<= (- (- c_i) (- (select c_a v_idx_110))) 41) (<= (- v_b_43_1 (select c_a v_idx_110)) 0) (<= (- (- v_b_44_1) (select c_a v_idx_110)) (- 44)) (<= (- (- (select c_a v_idx_110)) (select c_a v_idx_110)) (- 84)) (<= (- c_end (select c_a v_idx_110)) (- 1)) (<= (- (- c_i) (select c_a v_idx_110)) (- 43))))) (<= (- (- c_end) c_end) 0) (<= (- (- v_b_43_1) v_b_44_1) (- 3)) (<= (- v_b_44_1 c_i) 1) (<= (- (- c_end) c_i) (- 1)) (<= (- v_b_43_1 (- v_b_43_1)) 84) (<= (- c_end (- c_end)) 82) (<= (- v_b_43_1 (- c_i)) 84) (<= (- c_i (- c_i)) 84) (<= (- (- v_b_43_1) c_i) (- 2)) (<= (- (- c_i) v_v_645_1) (- 43)) (<= (- c_end (- c_i)) 83)))} [2018-12-19 12:29:55,451 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:29:55,462 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:29:55,462 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:29:57,338 WARN L181 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 285 DAG size of output: 152 [2018-12-19 12:29:57,339 WARN L270 ngHoareTripleChecker]: Pre: {2147483613#(exists ((v_b_43_1 Int) (v_b_44_1 Int) (v_v_645_1 Int)) (and (<= (- v_b_44_1 end) 43) (<= (- (- i) v_v_645_1) (- 42)) (<= (- v_b_44_1 v_v_645_1) 1) (<= (- (- end) (- v_v_645_1)) 42) (<= (- v_b_43_1 i) 0) (<= (- (- v_b_43_1) v_b_44_1) (- 1)) (<= (- v_b_43_1 end) 42) (<= (- (- v_b_43_1) (- i)) 0) (<= (- v_b_43_1 (- v_b_44_1)) 85) (<= (- v_v_645_1 (- v_v_645_1)) 84) (<= (- (- end) v_v_645_1) (- 42)) (<= (- i (- v_v_645_1)) 84) (<= (- v_b_43_1 (- v_v_645_1)) 84) (<= (- (- v_b_43_1) (- v_v_645_1)) 42) (<= (- (- v_b_44_1) i) (- 1)) (<= (- (- v_b_44_1) (- i)) (- 1)) (<= (- (- i) i) 0) (<= (- (- end) i) 0) (<= (- v_b_43_1 v_v_645_1) 0) (<= (- (- v_b_44_1) v_v_645_1) (- 43)) (<= (- v_b_43_1 v_b_44_1) (- 1)) (<= (- (- v_b_44_1) (- v_v_645_1)) 41) (<= (- (- v_v_645_1) v_v_645_1) (- 84)) (<= (- v_b_44_1 (- v_v_645_1)) 85) (<= (- (- v_b_43_1) v_b_43_1) 0) (<= (- (- end) end) 0) (<= (- (- v_b_44_1) end) (- 1)) (<= (- v_b_44_1 i) 1) (<= (- (- v_b_43_1) (- v_b_44_1)) 1) (<= (- v_b_43_1 (- v_b_43_1)) 84) (forall ((v_idx_105 Int) (v_idx_106 Int) (v_idx_107 Int)) (or (<= v_b_43_1 v_idx_105) (< v_idx_106 v_b_43_1) (<= v_b_44_1 v_idx_106) (and (<= (- v_b_44_1 (- (select a v_idx_106))) 85) (<= (- (- i) (select a v_idx_106)) (- 42)) (<= (- v_b_44_1 (select a v_idx_106)) 1) (<= (- (- end) (- (select a v_idx_106))) 42) (<= (- i (select a v_idx_106)) 0) (<= (- (select a v_idx_106) (- (select a v_idx_106))) 84) (<= (- (- end) (select a v_idx_106)) (- 42)) (<= (- i (- (select a v_idx_106))) 84) (<= (- v_b_43_1 (- (select a v_idx_106))) 84) (<= (- (- v_b_43_1) (- (select a v_idx_106))) 42) (<= (- (- v_b_43_1) (select a v_idx_106)) (- 42)) (<= (- v_b_43_1 (select a v_idx_106)) 0) (<= (- (- v_b_44_1) (select a v_idx_106)) (- 43)) (<= (- (- v_b_44_1) (- (select a v_idx_106))) 41) (<= (- (- (select a v_idx_106)) (select a v_idx_106)) (- 84)) (<= (- (- i) (- (select a v_idx_106))) 42)) (< v_idx_107 v_b_44_1))) (<= (- v_b_44_1 (- v_b_44_1)) 86) (<= (- v_b_44_1 (- i)) 85) (<= (- i v_v_645_1) 0) (<= (- (- end) (- i)) 42) (<= (- (- v_b_43_1) end) 0) (<= (- v_b_43_1 (- i)) 84) (<= (- (- v_b_44_1) v_b_44_1) (- 2)) (<= (- i (- i)) 84) (<= (- (- v_b_43_1) v_v_645_1) (- 42)) (<= (- (- v_b_43_1) i) 0) (<= (- (- i) (- v_v_645_1)) 42)))} [2018-12-19 12:29:57,339 WARN L274 ngHoareTripleChecker]: Action: assume !(i <= end); [2018-12-19 12:29:57,339 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_i c_end)) [2018-12-19 12:29:58,563 WARN L276 ngHoareTripleChecker]: Post: {2147483612#(and (<= 0 end) (<= 1 (+ end i)) (<= (- (- end) end) 0) (<= (* 2 end) 82) (<= end 41) (<= 1 i) (<= (* 2 i) 84) (exists ((v_b_43_1 Int) (v_b_44_1 Int)) (and (<= (- v_b_44_1 end) 43) (<= (- (- v_b_44_1) end) (- 2)) (<= (- v_b_43_1 i) 0) (<= (- v_b_43_1 end) 42) (forall ((v_prenex_32 Int)) (or (< v_prenex_32 v_b_43_1) (<= v_b_44_1 v_prenex_32) (<= (- (- v_b_44_1) (- (select a v_prenex_32))) 40))) (<= (- (- v_b_43_1) (- i)) 0) (forall ((v_prenex_31 Int)) (or (<= (- end (select a v_prenex_31)) (- 1)) (< v_prenex_31 v_b_43_1) (<= v_b_44_1 v_prenex_31))) (forall ((v_prenex_25 Int)) (or (<= (- v_b_43_1 (- (select a v_prenex_25))) 84) (< v_prenex_25 v_b_43_1) (<= v_b_44_1 v_prenex_25))) (<= (- (- v_b_44_1) v_b_44_1) (- 4)) (forall ((v_prenex_28 Int)) (or (<= v_b_44_1 v_prenex_28) (< v_prenex_28 v_b_43_1) (<= (- v_b_44_1 (select a v_prenex_28)) 1))) (<= v_b_44_1 (+ end 43)) (<= v_b_43_1 (+ v_b_44_1 40)) (forall ((v_idx_110 Int)) (or (<= (- (- v_b_43_1) (select a v_idx_110)) (- 43)) (<= v_b_44_1 v_idx_110) (< v_idx_110 v_b_43_1))) (<= (- (- v_b_44_1) (- i)) (- 1)) (<= (* 2 v_b_43_1) 84) (<= (- (- v_b_43_1) end) (- 1)) (<= i (+ v_b_44_1 40)) (<= end (+ v_b_44_1 39)) (forall ((v_prenex_18 Int)) (or (< v_prenex_18 v_b_43_1) (<= v_b_44_1 v_prenex_18) (<= (- end (- (select a v_prenex_18))) 83))) (forall ((v_prenex_24 Int)) (or (<= (- v_b_44_1 (- (select a v_prenex_24))) 85) (< v_prenex_24 v_b_43_1) (<= v_b_44_1 v_prenex_24))) (<= 3 (+ i v_b_44_1)) (<= 2 (+ end v_b_44_1)) (<= (- v_b_44_1 (- end)) 84) (forall ((v_prenex_27 Int)) (or (<= (- (- v_b_44_1) (select a v_prenex_27)) (- 44)) (<= v_b_44_1 v_prenex_27) (< v_prenex_27 v_b_43_1))) (<= (- (- v_b_43_1) (- v_b_44_1)) 1) (<= (- (- v_b_43_1) (- end)) (- 1)) (<= v_b_44_1 (+ i 42)) (forall ((v_prenex_29 Int)) (or (< v_prenex_29 v_b_43_1) (<= v_b_44_1 v_prenex_29) (<= (- (- end) (select a v_prenex_29)) (- 42)))) (<= (- v_b_44_1 (- v_b_44_1)) 86) (<= (- v_b_44_1 (- i)) 85) (<= (- (- v_b_44_1) i) (- 3)) (<= 1 (+ v_b_43_1 end)) (<= (+ v_b_43_1 i) 84) (<= (+ v_b_43_1 v_b_44_1) 85) (forall ((v_prenex_21 Int)) (or (<= v_b_44_1 v_prenex_21) (< v_prenex_21 v_b_43_1) (<= (- (- (select a v_prenex_21)) (select a v_prenex_21)) (- 84)))) (<= (- (- v_b_44_1) (- end)) (- 2)) (forall ((v_prenex_19 Int)) (or (< v_prenex_19 v_b_43_1) (<= (- (- i) (select a v_prenex_19)) (- 43)) (<= v_b_44_1 v_prenex_19))) (<= (+ i v_b_44_1) 85) (<= 4 (* 2 v_b_44_1)) (forall ((v_prenex_22 Int)) (or (< v_prenex_22 v_b_43_1) (<= (- (- v_b_43_1) (- (select a v_prenex_22))) 41) (<= v_b_44_1 v_prenex_22))) (<= 2 (+ v_b_43_1 i)) (<= end (+ v_b_43_1 40)) (<= (- v_b_43_1 (- end)) 83) (<= 2 v_b_44_1) (<= v_b_44_1 43) (<= (- v_b_43_1 (- v_b_44_1)) 85) (<= v_b_44_1 (+ v_b_43_1 42)) (<= v_b_43_1 42) (forall ((v_prenex_34 Int)) (or (<= (- i (select a v_prenex_34)) 0) (<= v_b_44_1 v_prenex_34) (< v_prenex_34 v_b_43_1))) (<= (- (- v_b_43_1) v_b_43_1) (- 2)) (forall ((v_prenex_26 Int)) (or (< v_prenex_26 v_b_43_1) (<= (- (select a v_prenex_26) (- (select a v_prenex_26))) 84) (<= v_b_44_1 v_prenex_26))) (<= (- v_b_43_1 v_b_44_1) (- 1)) (<= 1 v_b_43_1) (<= (- (- v_b_43_1) v_b_44_1) (- 3)) (<= v_b_43_1 (+ i 41)) (forall ((v_prenex_20 Int)) (or (<= v_b_44_1 v_prenex_20) (< v_prenex_20 v_b_43_1) (<= (- (- i) (- (select a v_prenex_20))) 41))) (<= 2 (* 2 v_b_43_1)) (<= v_b_43_1 (+ end 42)) (<= (- v_b_44_1 i) 1) (<= (- v_b_43_1 (- v_b_43_1)) 84) (<= (* 2 v_b_44_1) 86) (<= (+ end v_b_44_1) 84) (forall ((v_prenex_33 Int)) (or (<= v_b_44_1 v_prenex_33) (< v_prenex_33 v_b_43_1) (<= (- (- end) (- (select a v_prenex_33))) 42))) (<= (+ v_b_43_1 end) 83) (<= (- v_b_43_1 (- i)) 84) (<= (- (- v_b_43_1) i) (- 2)) (forall ((v_prenex_23 Int)) (or (<= (- v_b_43_1 (select a v_prenex_23)) 0) (<= v_b_44_1 v_prenex_23) (< v_prenex_23 v_b_43_1))) (forall ((v_prenex_30 Int)) (or (< v_prenex_30 v_b_43_1) (<= v_b_44_1 v_prenex_30) (<= (- i (- (select a v_prenex_30))) 84))) (<= 3 (+ v_b_43_1 v_b_44_1)) (<= i (+ v_b_43_1 41)))) (<= (- (- end) i) (- 1)) (<= (- end i) (- 1)) (<= (- (- i) i) (- 2)) (<= end (+ i 40)) (<= (- (- end) (- i)) 42) (<= (- end (- end)) 82) (<= i (+ end 42)) (<= (- i (- i)) 84) (<= 2 (* 2 i)) (<= (+ end i) 83) (<= 0 (* 2 end)) (<= i 42) (<= (- end (- i)) 83))} [2018-12-19 12:30:02,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:30:02,117 INFO L272 AbstractInterpreter]: Visited 4 different actions 22 times. Merged at 3 different actions 17 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:30:02,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:30:02,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:30:02,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:30:02,124 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 [2018-12-19 12:30:02,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:30:02,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:30:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:30:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:30:02,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:30:02,191 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 [2018-12-19 12:30:02,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:30:02,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:30:02,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-19 12:30:02,207 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:30:02,208 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_5]. (and (<= i 0) (<= 0 end) (= a (store v_a_5 end 42))) [2018-12-19 12:30:02,208 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= i 0) (<= 0 end) (= 42 (select a end))) [2018-12-19 12:30:02,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-19 12:30:02,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:30:02,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:30:02,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2018-12-19 12:30:02,326 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:30:02,326 WARN L384 uantifierElimination]: Input elimination task: ∃ [a, v_i_7]. (and (<= 0 end) (= 42 (select a end)) (not (= 42 (select a v_i_7))) (<= v_i_7 0) (<= i (+ v_i_7 1))) [2018-12-19 12:30:02,327 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 end) (let ((.cse0 (<= i 1))) (or (and .cse0 (<= (+ end 1) 0)) (and .cse0 (<= i end))))) [2018-12-19 12:30:02,362 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} assume end >= 0;a := a[end := 42];i := 0; {49#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} is VALID [2018-12-19 12:30:02,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {53#(and (<= 0 end) (<= i 1) (<= i end))} is VALID [2018-12-19 12:30:02,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#(and (<= 0 end) (<= i 1) (<= i end))} assume !(a[i] != 42); {53#(and (<= 0 end) (<= i 1) (<= i end))} is VALID [2018-12-19 12:30:02,365 INFO L273 TraceCheckUtils]: 3: Hoare triple {53#(and (<= 0 end) (<= i 1) (<= i end))} assume !(i <= end); {43#false} is VALID [2018-12-19 12:30:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:30:02,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:30:02,413 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#(<= i end)} assume !(i <= end); {43#false} is VALID [2018-12-19 12:30:02,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#(<= i end)} assume !(a[i] != 42); {45#(<= i end)} is VALID [2018-12-19 12:30:02,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {66#(or (= 42 (select a i)) (< i end))} assume a[i] != 42;i := i + 1; {45#(<= i end)} is VALID [2018-12-19 12:30:02,417 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} assume end >= 0;a := a[end := 42];i := 0; {66#(or (= 42 (select a i)) (< i end))} is VALID [2018-12-19 12:30:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:30:02,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:30:02,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2018-12-19 12:30:02,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:30:02,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:30:02,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:30:02,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:30:02,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:30:02,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:30:02,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:30:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:30:02,456 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-19 12:30:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:30:02,554 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-12-19 12:30:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:30:02,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:30:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:30:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:30:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-19 12:30:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:30:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-19 12:30:02,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2018-12-19 12:30:02,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:30:02,579 INFO L225 Difference]: With dead ends: 10 [2018-12-19 12:30:02,579 INFO L226 Difference]: Without dead ends: 7 [2018-12-19 12:30:02,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:30:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-19 12:30:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-19 12:30:02,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:30:02,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-19 12:30:02,636 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-19 12:30:02,636 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-19 12:30:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:30:02,638 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-19 12:30:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-19 12:30:02,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:30:02,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:30:02,639 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-19 12:30:02,639 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-19 12:30:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:30:02,640 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-19 12:30:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-19 12:30:02,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:30:02,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:30:02,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:30:02,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:30:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:30:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-19 12:30:02,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-19 12:30:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:30:02,643 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-19 12:30:02,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:30:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-19 12:30:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-19 12:30:02,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:30:02,644 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-19 12:30:02,644 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:30:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:30:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 2 times [2018-12-19 12:30:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:30:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:30:02,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:30:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:30:02,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:30:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:30:02,883 INFO L273 TraceCheckUtils]: 0: Hoare triple {110#true} assume end >= 0;a := a[end := 42];i := 0; {112#(and (< i (+ end 1)) (= 42 (select a end)))} is VALID [2018-12-19 12:30:02,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {112#(and (< i (+ end 1)) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {112#(and (< i (+ end 1)) (= 42 (select a end)))} is VALID [2018-12-19 12:30:02,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (< i (+ end 1)) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {113#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} is VALID [2018-12-19 12:30:02,886 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(and (< i (+ end 1)) (or (= (select a i) 42) (not (= end i))))} assume a[i] != 42;i := i + 1; {114#(<= i end)} is VALID [2018-12-19 12:30:02,886 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= i end)} assume !(a[i] != 42); {114#(<= i end)} is VALID [2018-12-19 12:30:02,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {114#(<= i end)} assume !(i <= end); {111#false} is VALID [2018-12-19 12:30:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:30:02,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:30:02,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:30:02,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:30:02,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:30:02,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:30:02,890 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 [2018-12-19 12:30:02,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-19 12:30:02,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-19 12:30:02,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-19 12:30:02,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:30:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:30:02,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:30:02,973 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 [2018-12-19 12:30:02,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:30:02,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:30:02,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-19 12:30:02,985 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:30:02,986 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_a_6]. (and (<= i 0) (<= 0 end) (= a (store v_a_6 end 42))) [2018-12-19 12:30:02,986 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= i 0) (<= 0 end) (= 42 (select a end))) [2018-12-19 12:30:03,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2018-12-19 12:30:03,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-19 12:30:03,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:30:03,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:69 [2018-12-19 12:30:03,313 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:30:03,314 WARN L384 uantifierElimination]: Input elimination task: ∃ [a, v_i_9, v_i_10, v_i_11]. (and (<= v_i_9 0) (<= 0 end) (not (= (select a v_i_9) 42)) (<= v_i_10 (+ v_i_9 1)) (<= v_i_11 (+ v_i_10 1)) (<= i (+ v_i_11 1)) (= 42 (select a end)) (not (= 42 (select a v_i_10))) (not (= 42 (select a v_i_11)))) [2018-12-19 12:30:03,314 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 end) (let ((.cse5 (+ end 1))) (let ((.cse3 (<= i .cse5)) (.cse0 (<= i 3)) (.cse4 (<= i end)) (.cse1 (<= .cse5 0)) (.cse2 (<= end 0))) (or (and (<= end 1) .cse0 .cse1 .cse2) (and (<= i (+ end 2)) .cse3 .cse0 .cse4) (and .cse3 .cse0 .cse4 .cse1) (and .cse0 .cse4 .cse1 .cse2))))) [2018-12-19 12:30:03,451 INFO L273 TraceCheckUtils]: 0: Hoare triple {110#true} assume end >= 0;a := a[end := 42];i := 0; {118#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} is VALID [2018-12-19 12:30:03,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#(and (<= i 0) (<= 0 end) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {122#(and (<= 0 end) (= 42 (select a end)) (exists ((v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_9 1)))))} is VALID [2018-12-19 12:30:03,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {122#(and (<= 0 end) (= 42 (select a end)) (exists ((v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_9 1)))))} assume a[i] != 42;i := i + 1; {126#(and (<= 0 end) (exists ((v_i_10 Int) (v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_10 1)) (<= v_i_10 (+ v_i_9 1)) (not (= 42 (select a v_i_10))))) (= 42 (select a end)))} is VALID [2018-12-19 12:30:03,456 INFO L273 TraceCheckUtils]: 3: Hoare triple {126#(and (<= 0 end) (exists ((v_i_10 Int) (v_i_9 Int)) (and (<= v_i_9 0) (not (= (select a v_i_9) 42)) (<= i (+ v_i_10 1)) (<= v_i_10 (+ v_i_9 1)) (not (= 42 (select a v_i_10))))) (= 42 (select a end)))} assume a[i] != 42;i := i + 1; {130#(and (<= 0 end) (<= i 3) (<= i end))} is VALID [2018-12-19 12:30:03,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#(and (<= 0 end) (<= i 3) (<= i end))} assume !(a[i] != 42); {130#(and (<= 0 end) (<= i 3) (<= i end))} is VALID [2018-12-19 12:30:03,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {130#(and (<= 0 end) (<= i 3) (<= i end))} assume !(i <= end); {111#false} is VALID [2018-12-19 12:30:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:30:03,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:30:03,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {114#(<= i end)} assume !(i <= end); {111#false} is VALID [2018-12-19 12:30:03,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= i end)} assume !(a[i] != 42); {114#(<= i end)} is VALID [2018-12-19 12:30:03,590 INFO L273 TraceCheckUtils]: 3: Hoare triple {143#(or (= 42 (select a i)) (< i end))} assume a[i] != 42;i := i + 1; {114#(<= i end)} is VALID [2018-12-19 12:30:03,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {147#(or (= 42 (select a i)) (forall ((v_i_13 Int)) (or (= (select a v_i_13) 42) (< (+ i 1) v_i_13) (< v_i_13 end))))} assume a[i] != 42;i := i + 1; {143#(or (= 42 (select a i)) (< i end))} is VALID [2018-12-19 12:30:03,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#(or (= 42 (select a i)) (forall ((v_i_13 Int) (v_i_14 Int)) (or (= (select a v_i_14) 42) (= (select a v_i_13) 42) (< (+ i 1) v_i_14) (< v_i_13 end) (< (+ v_i_14 1) v_i_13))))} assume a[i] != 42;i := i + 1; {147#(or (= 42 (select a i)) (forall ((v_i_13 Int)) (or (= (select a v_i_13) 42) (< (+ i 1) v_i_13) (< v_i_13 end))))} is VALID [2018-12-19 12:30:03,596 INFO L273 TraceCheckUtils]: 0: Hoare triple {110#true} assume end >= 0;a := a[end := 42];i := 0; {151#(or (= 42 (select a i)) (forall ((v_i_13 Int) (v_i_14 Int)) (or (= (select a v_i_14) 42) (= (select a v_i_13) 42) (< (+ i 1) v_i_14) (< v_i_13 end) (< (+ v_i_14 1) v_i_13))))} is VALID [2018-12-19 12:30:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:30:03,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:30:03,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2018-12-19 12:30:03,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:30:03,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-19 12:30:03,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:30:03,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-12-19 12:30:03,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:30:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-19 12:30:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-19 12:30:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:30:03,659 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 9 states. [2018-12-19 12:30:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:30:03,781 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-19 12:30:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:30:03,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-19 12:30:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:30:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:30:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-19 12:30:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:30:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-19 12:30:03,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2018-12-19 12:30:03,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:30:03,798 INFO L225 Difference]: With dead ends: 9 [2018-12-19 12:30:03,799 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 12:30:03,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:30:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 12:30:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 12:30:03,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:30:03,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 12:30:03,800 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:30:03,800 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:30:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:30:03,800 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:30:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:30:03,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:30:03,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:30:03,801 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:30:03,801 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:30:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:30:03,801 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:30:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:30:03,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:30:03,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:30:03,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:30:03,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:30:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 12:30:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 12:30:03,802 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-19 12:30:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:30:03,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 12:30:03,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-19 12:30:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:30:03,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:30:03,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 12:30:03,884 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 17 19) the Hoare annotation is: (and (< i (+ end 1)) (= 42 (select a end))) [2018-12-19 12:30:03,884 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 21) no Hoare annotation was computed. [2018-12-19 12:30:03,885 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2018-12-19 12:30:03,885 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2018-12-19 12:30:03,885 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 20) no Hoare annotation was computed. [2018-12-19 12:30:03,885 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-19 12:30:03,886 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-12-19 12:30:03,903 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-12-19 12:30:03,904 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-12-19 12:30:03,904 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-12-19 12:30:03,904 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-12-19 12:30:03,904 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 12:30:03,910 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:30:03 BoogieIcfgContainer [2018-12-19 12:30:03,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 12:30:03,911 INFO L168 Benchmark]: Toolchain (without parser) took 35408.22 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -159.9 MB). Peak memory consumption was 881.9 MB. Max. memory is 7.1 GB. [2018-12-19 12:30:03,913 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:30:03,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:30:03,914 INFO L168 Benchmark]: Boogie Preprocessor took 22.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:30:03,914 INFO L168 Benchmark]: RCFGBuilder took 450.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:30:03,915 INFO L168 Benchmark]: TraceAbstraction took 34893.95 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -181.0 MB). Peak memory consumption was 860.7 MB. Max. memory is 7.1 GB. [2018-12-19 12:30:03,919 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 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 36.47 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 22.64 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 450.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34893.95 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -181.0 MB). Peak memory consumption was 860.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i < end + 1 && 42 == a[end] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 34.7s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 34 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 31.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 1 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 26 ConstructedInterpolants, 4 QuantifiedInterpolants, 1239 SizeOfPredicates, 2 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...