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/codeblockAssertOrder01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:07:17,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:07:17,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:07:17,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:07:17,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:07:17,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:07:17,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:07:17,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:07:17,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:07:17,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:07:17,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:07:17,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:07:17,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:07:17,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:07:17,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:07:17,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:07:17,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:07:17,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:07:17,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:07:17,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:07:17,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:07:17,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:07:17,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:07:17,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:07:17,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:07:17,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:07:17,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:07:17,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:07:17,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:07:17,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:07:17,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:07:17,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:07:17,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:07:17,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:07:17,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:07:17,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:07:17,297 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 15:07:17,317 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:07:17,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:07:17,319 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:07:17,319 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:07:17,320 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:07:17,320 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:07:17,320 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:07:17,320 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:07:17,320 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:07:17,321 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:07:17,323 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:07:17,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:07:17,323 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:07:17,324 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:07:17,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:07:17,325 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:07:17,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:07:17,326 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:07:17,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:07:17,326 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:07:17,326 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:07:17,327 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:07:17,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:07:17,327 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:07:17,327 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:07:17,327 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:07:17,328 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:07:17,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:07:17,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:07:17,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:07:17,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:07:17,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:07:17,331 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:07:17,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:07:17,331 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:07:17,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:07:17,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:07:17,332 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:07:17,332 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:07:17,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:07:17,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:07:17,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:07:17,393 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:07:17,394 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:07:17,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl [2019-01-31 15:07:17,395 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl' [2019-01-31 15:07:17,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:07:17,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:07:17,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:07:17,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:07:17,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:07:17,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,468 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 15:07:17,468 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 15:07:17,469 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 15:07:17,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:07:17,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:07:17,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:07:17,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:07:17,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/1) ... [2019-01-31 15:07:17,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:07:17,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:07:17,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:07:17,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:07:17,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 15:07:17,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 15:07:17,808 INFO L278 CfgBuilder]: Using library mode [2019-01-31 15:07:17,809 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 15:07:17,810 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:07:17 BoogieIcfgContainer [2019-01-31 15:07:17,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:07:17,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:07:17,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:07:17,814 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:07:17,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:17" (1/2) ... [2019-01-31 15:07:17,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f8dfe9 and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:07:17, skipping insertion in model container [2019-01-31 15:07:17,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:07:17" (2/2) ... [2019-01-31 15:07:17,818 INFO L112 eAbstractionObserver]: Analyzing ICFG codeblockAssertOrder01.bpl [2019-01-31 15:07:17,827 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:07:17,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 15:07:17,850 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 15:07:17,880 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:07:17,881 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:07:17,881 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:07:17,881 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:07:17,881 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:07:17,881 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:07:17,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:07:17,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:07:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 15:07:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:07:17,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:07:17,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:07:17,906 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:07:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:07:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-31 15:07:17,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:07:17,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:17,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:07:17,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:17,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:07:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:07:18,174 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0; {11#(<= main_i 0)} is VALID [2019-01-31 15:07:18,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= main_i 0)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {10#false} is VALID [2019-01-31 15:07:18,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[q] == 5); {10#false} is VALID [2019-01-31 15:07:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:07:18,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:07:18,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 15:07:18,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:07:18,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:07:18,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:07:18,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:07:18,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:18,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:07:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:07:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:07:18,255 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 15:07:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:18,341 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 15:07:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:07:18,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:07:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:07:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:07:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 15:07:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:07:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 15:07:18,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-31 15:07:18,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:18,414 INFO L225 Difference]: With dead ends: 11 [2019-01-31 15:07:18,414 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 15:07:18,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:07:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 15:07:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 15:07:18,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:07:18,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 15:07:18,483 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 15:07:18,483 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 15:07:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:18,485 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:07:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:07:18,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:18,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:18,486 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 15:07:18,487 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 15:07:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:18,488 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:07:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:07:18,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:18,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:18,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:07:18,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:07:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 15:07:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 15:07:18,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 15:07:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:07:18,493 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 15:07:18,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:07:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:07:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:07:18,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:07:18,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:07:18,495 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:07:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:07:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-31 15:07:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:07:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:18,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:07:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:18,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:07:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:07:18,900 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0; {46#(<= main_i 0)} is VALID [2019-01-31 15:07:18,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(<= main_i 0)} assume i <= 1000;i := i + 1; {47#(<= main_i 1)} is VALID [2019-01-31 15:07:18,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(<= main_i 1)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {45#false} is VALID [2019-01-31 15:07:18,921 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#false} assume !(a[q] == 5); {45#false} is VALID [2019-01-31 15:07:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:07:18,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:07:18,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:07:18,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:07:18,926 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-31 15:07:19,001 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:07:19,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:07:22,551 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 15:07:22,553 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 1 different actions 12 times. Widened at 1 different actions 8 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 15:07:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:07:22,558 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 15:07:24,588 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 50% of their original sizes. [2019-01-31 15:07:24,593 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 15:07:24,696 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 15:07:25,108 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 15:07:25,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 15:07:25,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-31 15:07:25,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:07:25,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 15:07:25,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:07:25,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 15:07:25,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:25,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 15:07:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 15:07:25,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 15:07:25,126 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-31 15:07:25,171 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:25,173 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:25,173 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:25,175 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:25,175 WARN L224 ngHoareTripleChecker]: Pre: {86#(<= (- (- c_main_i) c_main_i) 0)} [2019-01-31 15:07:25,175 WARN L228 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-31 15:07:25,176 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-31 15:07:25,176 WARN L230 ngHoareTripleChecker]: Post: {87#false} [2019-01-31 15:07:25,176 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:25,178 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:25,178 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:25,183 WARN L270 ngHoareTripleChecker]: Pre: {86#(<= (- (- main_i) main_i) 0)} [2019-01-31 15:07:25,184 WARN L274 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-31 15:07:25,185 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-31 15:07:25,186 WARN L276 ngHoareTripleChecker]: Post: {87#false} [2019-01-31 15:07:25,187 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:25,187 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:25,187 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[main_a] -> [-inf_0] v_451 [inf_0], }, Substate: {ints: {main_i = [0; inf]}, 4 vars top, }}} [2019-01-31 15:07:25,188 WARN L628 ntHoareTripleChecker]: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) (assume i <= 1000;i := i + 1;) [2019-01-31 15:07:25,188 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:07:25,188 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:25,526 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:25,527 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:25,528 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:25,528 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:25,528 WARN L224 ngHoareTripleChecker]: Pre: {88#(<= (- (- c_main_i) c_main_i) 0)} [2019-01-31 15:07:25,528 WARN L228 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-31 15:07:25,529 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-31 15:07:25,529 WARN L230 ngHoareTripleChecker]: Post: {89#(forall ((v_idx_144 Int)) (and (or (< (+ v_idx_144 c_main_q) 84) (= (select c_main_a v_idx_144) (+ c_main_q (- 37))) (<= 43 v_idx_144)) (<= (* 2 c_main_q) 84) (<= (- (- c_main_q) c_main_q) (- 84)) (<= (- c_main_q (- c_main_q)) 84) (<= 42 c_main_q) (<= 84 (* 2 c_main_q)) (<= c_main_q 42)))} [2019-01-31 15:07:25,529 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:25,534 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:25,534 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:25,537 WARN L270 ngHoareTripleChecker]: Pre: {88#(<= (- (- main_i) main_i) 0)} [2019-01-31 15:07:25,537 WARN L274 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-31 15:07:25,537 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-31 15:07:25,658 WARN L276 ngHoareTripleChecker]: Post: {89#(and (forall ((v_idx_144 Int)) (or (< (+ v_idx_144 main_q) 84) (= (select main_a v_idx_144) (+ main_q (- 37))) (<= 43 v_idx_144))) (<= (* 2 main_q) 84) (<= (- (- main_q) main_q) (- 84)) (<= (- main_q (- main_q)) 84) (<= 42 main_q) (<= 84 (* 2 main_q)) (<= main_q 42))} [2019-01-31 15:07:25,658 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:25,658 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:25,659 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[main_a] -> [-inf_0] v_452 [inf_0], }, Substate: {ints: {main_i = [0; inf]}, 4 vars top, }}} [2019-01-31 15:07:25,659 WARN L628 ntHoareTripleChecker]: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) (assume i <= 1000;i := i + 1;) [2019-01-31 15:07:25,659 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {[main_a] -> [-inf_0] v_399 [b_48] v_400 [b_49] v_401 [inf_0], }, Substate: {ints: {main_q = [42; 42]; v_400 = [5; 5]; b_48 = [42; 42]; b_49 = [43; 43]}, 2 vars top, relations: {b_48 + main_q = [84; 84]; b_48 - main_q = [0; 0]; b_49 + main_q = [85; 85]; b_49 - main_q = [1; 1]; main_q + v_400 = [47; 47]; main_q - v_400 = [37; 37]; b_48 + v_400 = [47; 47]; b_48 - v_400 = [37; 37]; b_49 + v_400 = [48; 48]; b_49 - v_400 = [38; 38]; b_48 + b_49 = [85; 85]; b_48 - b_49 = [-1; -1]}, }}} [2019-01-31 15:07:25,659 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:25,676 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:25,677 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:25,677 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:25,677 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:25,678 WARN L224 ngHoareTripleChecker]: Pre: {92#(<= (- (- c_main_i) c_main_i) 0)} [2019-01-31 15:07:25,678 WARN L228 ngHoareTripleChecker]: Action: assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; [2019-01-31 15:07:25,678 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (<= c_main_i 1000)) (< 41 c_main_p) (< 41 c_main_q) (= c_main_a_primed (store c_main_a c_main_p 5)) (< c_main_p 43) (< c_main_q 43)) [2019-01-31 15:07:25,679 WARN L230 ngHoareTripleChecker]: Post: {93#false} [2019-01-31 15:07:25,679 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:25,680 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:25,680 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:25,683 WARN L270 ngHoareTripleChecker]: Pre: {92#(<= (- (- main_i) main_i) 0)} [2019-01-31 15:07:25,683 WARN L274 ngHoareTripleChecker]: Action: assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; [2019-01-31 15:07:25,683 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (<= c_main_i 1000)) (< 41 c_main_p) (< 41 c_main_q) (= c_main_a_primed (store c_main_a c_main_p 5)) (< c_main_p 43) (< c_main_q 43)) [2019-01-31 15:07:25,722 WARN L276 ngHoareTripleChecker]: Post: {93#false} [2019-01-31 15:07:25,722 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:25,723 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:25,723 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[main_a] -> [-inf_0] v_459 [inf_0], }, Substate: {ints: {main_i = [0; inf]}, 4 vars top, }}} [2019-01-31 15:07:25,723 WARN L628 ntHoareTripleChecker]: (and (not (<= c_main_i 1000)) (< 41 c_main_p) (< 41 c_main_q) (= c_main_a_primed (store c_main_a c_main_p 5)) (< c_main_p 43) (< c_main_q 43)) (assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43;) [2019-01-31 15:07:25,723 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:07:25,724 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:26,185 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:07:26,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 15:07:26,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 15:07:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:07:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:07:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-31 15:07:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:07:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-31 15:07:26,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-01-31 15:07:26,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:26,247 INFO L225 Difference]: With dead ends: 5 [2019-01-31 15:07:26,247 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 15:07:26,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 15:07:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 15:07:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 15:07:26,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:07:26,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:26,249 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:26,249 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:26,249 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:07:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:07:26,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:26,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:26,253 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:26,253 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:26,253 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:07:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:07:26,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:26,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:26,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:07:26,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:07:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 15:07:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 15:07:26,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-31 15:07:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:07:26,255 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 15:07:26,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 15:07:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:07:26,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:26,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 15:07:26,339 INFO L444 ceAbstractionStarter]: At program point L15-1(lines 15 17) the Hoare annotation is: (<= 0 (* 2 main_i)) [2019-01-31 15:07:26,339 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 10 22) no Hoare annotation was computed. [2019-01-31 15:07:26,340 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2019-01-31 15:07:26,340 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2019-01-31 15:07:26,340 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-31 15:07:26,340 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 21) no Hoare annotation was computed. [2019-01-31 15:07:26,342 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-31 15:07:26,357 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-31 15:07:26,357 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-31 15:07:26,358 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-31 15:07:26,358 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-31 15:07:26,358 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 15:07:26,365 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 03:07:26 BoogieIcfgContainer [2019-01-31 15:07:26,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 15:07:26,367 INFO L168 Benchmark]: Toolchain (without parser) took 8934.03 ms. Allocated memory was 138.9 MB in the beginning and 321.4 MB in the end (delta: 182.5 MB). Free memory was 105.3 MB in the beginning and 292.3 MB in the end (delta: -187.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:07:26,370 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:07:26,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.58 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 103.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-31 15:07:26,373 INFO L168 Benchmark]: Boogie Preprocessor took 20.44 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 15:07:26,374 INFO L168 Benchmark]: RCFGBuilder took 317.78 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 92.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-01-31 15:07:26,375 INFO L168 Benchmark]: TraceAbstraction took 8554.65 ms. Allocated memory was 138.9 MB in the beginning and 321.4 MB in the end (delta: 182.5 MB). Free memory was 92.1 MB in the beginning and 292.3 MB in the end (delta: -200.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:07:26,380 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.24 ms. Allocated memory is still 138.9 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.58 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 103.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.44 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.78 ms. Allocated memory is still 138.9 MB. Free memory was 102.2 MB in the beginning and 92.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8554.65 ms. Allocated memory was 138.9 MB in the beginning and 321.4 MB in the end (delta: 182.5 MB). Free memory was 92.1 MB in the beginning and 292.3 MB in the end (delta: -200.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: 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: 15]: Loop Invariant Derived loop invariant: 0 <= 2 * i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 8.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 4 SDs, 0 SdLazy, 3 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 5 HoareAnnotationTreeSize, 1 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...