java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:04:30,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:04:30,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:04:30,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:04:30,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:04:30,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:04:30,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:04:30,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:04:30,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:04:30,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:04:30,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:04:30,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:04:30,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:04:30,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:04:30,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:04:30,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:04:30,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:04:30,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:04:30,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:04:30,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:04:30,430 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:04:30,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:04:30,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:04:30,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:04:30,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:04:30,436 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:04:30,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:04:30,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:04:30,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:04:30,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:04:30,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:04:30,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:04:30,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:04:30,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:04:30,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:04:30,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:04:30,443 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:04:30,456 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:04:30,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:04:30,457 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:04:30,457 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:04:30,458 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:04:30,458 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:04:30,458 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:04:30,458 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:04:30,458 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:04:30,459 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:04:30,459 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:04:30,459 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:04:30,459 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:04:30,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:04:30,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:04:30,460 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:04:30,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:04:30,461 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:04:30,461 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:04:30,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:04:30,462 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:04:30,462 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:04:30,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:04:30,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:04:30,462 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:04:30,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:04:30,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:04:30,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:04:30,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:04:30,463 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:04:30,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:04:30,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:04:30,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:04:30,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:04:30,464 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:04:30,465 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:04:30,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:04:30,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:04:30,465 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:04:30,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:04:30,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:04:30,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:04:30,511 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:04:30,511 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:04:30,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-31 15:04:30,512 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-31 15:04:30,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:04:30,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:04:30,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:04:30,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:04:30,549 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:04:30,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,581 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 15:04:30,582 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 15:04:30,582 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 15:04:30,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:04:30,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:04:30,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:04:30,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:04:30,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/1) ... [2019-01-31 15:04:30,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:04:30,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:04:30,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:04:30,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:04:30,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (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:04:30,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 15:04:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 15:04:30,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 15:04:30,989 INFO L278 CfgBuilder]: Using library mode [2019-01-31 15:04:30,989 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 15:04:30,990 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:04:30 BoogieIcfgContainer [2019-01-31 15:04:30,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:04:30,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:04:30,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:04:30,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:04:30,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:04:30" (1/2) ... [2019-01-31 15:04:30,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332a38af and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:04:30, skipping insertion in model container [2019-01-31 15:04:30,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:04:30" (2/2) ... [2019-01-31 15:04:30,999 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-31 15:04:31,009 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:04:31,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 15:04:31,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 15:04:31,070 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:04:31,071 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:04:31,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:04:31,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:04:31,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:04:31,071 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:04:31,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:04:31,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:04:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 15:04:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:04:31,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:04:31,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:04:31,096 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:04:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:04:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-31 15:04:31,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:04:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:04:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:04:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:04:31,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:04:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:04:31,457 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-01-31 15:04:31,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-01-31 15:04:31,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-01-31 15:04:31,479 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:04:31,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:04:31,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 15:04:31,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:04:31,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:04:31,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:04:31,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:04:31,539 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:04:31,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:04:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:04:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:04:31,552 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 15:04:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:04:31,651 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 15:04:31,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:04:31,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:04:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:04:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:04:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 15:04:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:04:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-31 15:04:31,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-31 15:04:31,715 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:04:31,726 INFO L225 Difference]: With dead ends: 11 [2019-01-31 15:04:31,726 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 15:04:31,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:04:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 15:04:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 15:04:31,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:04:31,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 15:04:31,797 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 15:04:31,797 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 15:04:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:04:31,798 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:04:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:04:31,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:04:31,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:04:31,800 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 15:04:31,800 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 15:04:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:04:31,801 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 15:04:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:04:31,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:04:31,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:04:31,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:04:31,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:04:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 15:04:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 15:04:31,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 15:04:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:04:31,809 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 15:04:31,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:04:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 15:04:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:04:31,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:04:31,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:04:31,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:04:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:04:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-31 15:04:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:04:31,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:04:31,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:04:31,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:04:31,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:04:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:04:32,530 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-31 15:04:32,567 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-01-31 15:04:32,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(= i 0)} assume i < n;a := a[i := 0];i := i + 1; {47#(and (<= i 1) (= 0 (select a 0)))} is VALID [2019-01-31 15:04:32,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(and (<= i 1) (= 0 (select a 0)))} assume !(i < n);assume 0 <= r && r < n; {48#(and (= r 0) (= 0 (select a r)))} is VALID [2019-01-31 15:04:32,578 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-01-31 15:04:32,578 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:04:32,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:04:32,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:04:32,580 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:04:32,582 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-31 15:04:32,633 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:04:32,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:04:49,453 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 15:04:49,454 INFO L272 AbstractInterpreter]: Visited 4 different actions 15 times. Merged at 2 different actions 7 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 15:04:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:04:49,460 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 15:04:51,735 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 42.22% of their original sizes. [2019-01-31 15:04:51,788 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 15:04:52,145 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 15:04:52,557 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 15:04:52,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 15:04:52,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-31 15:04:52,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:04:52,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 15:04:52,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:04:52,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 15:04:52,614 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:04:52,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 15:04:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 15:04:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 15:04:52,616 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-31 15:04:52,660 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:04:52,660 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:04:52,661 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:04:52,662 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:04:52,662 WARN L224 ngHoareTripleChecker]: Pre: {87#(forall ((v_idx_297 Int)) (and (<= 0 c_i) (<= 0 (* 2 c_i)) (<= (- (- c_i) c_i) 0) (or (= (select c_a v_idx_297) 0) (<= c_i v_idx_297) (< v_idx_297 0))))} [2019-01-31 15:04:52,662 WARN L228 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-01-31 15:04:52,663 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-01-31 15:04:52,664 WARN L230 ngHoareTripleChecker]: Post: {88#false} [2019-01-31 15:04:52,664 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:04:52,669 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:04:52,669 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:04:52,793 WARN L270 ngHoareTripleChecker]: Pre: {87#(and (<= 0 i) (<= 0 (* 2 i)) (forall ((v_idx_297 Int)) (or (= (select a v_idx_297) 0) (<= i v_idx_297) (< v_idx_297 0))) (<= (- (- i) i) 0))} [2019-01-31 15:04:52,794 WARN L274 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-01-31 15:04:52,794 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-01-31 15:04:52,805 WARN L276 ngHoareTripleChecker]: Post: {88#false} [2019-01-31 15:04:52,805 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:04:52,806 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:04:52,806 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_272 [b_24] v_273 [b_25] v_274 [inf_0], [old(a)] -> [-inf_0] v_626 [inf_0], }, Substate: {ints: {b_25 = [0; inf]; b_24 = [0; 0]; v_273 = [0; 0]; i = [0; inf]}, 10 vars top, relations: {b_24 + b_25 = [0; inf]; b_24 - b_25 = [-inf; 0]; b_25 + v_273 = [0; inf]; b_25 - v_273 = [0; inf]; b_24 + v_273 = [0; 0]; b_24 - v_273 = [0; 0]; i + v_273 = [0; inf]; i - v_273 = [0; inf]; b_25 + i = [0; inf]; b_25 - i = [0; 0]; b_24 + i = [0; inf]; b_24 - i = [-inf; 0]}, }}} [2019-01-31 15:04:52,807 WARN L628 ntHoareTripleChecker]: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) (assume i < n;a := a[i := 0];i := i + 1;) [2019-01-31 15:04:52,807 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:04:52,808 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:04:53,412 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:04:53,413 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:04:53,413 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:04:53,413 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:04:53,414 WARN L224 ngHoareTripleChecker]: Pre: {89#(forall ((v_idx_313 Int)) (and (<= 0 c_i) (<= 0 (* 2 c_i)) (<= (- (- c_i) c_i) 0) (or (< v_idx_313 0) (<= c_i v_idx_313) (= (select c_a v_idx_313) 0))))} [2019-01-31 15:04:53,414 WARN L228 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-01-31 15:04:53,414 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-01-31 15:04:53,414 WARN L230 ngHoareTripleChecker]: Post: {90#(forall ((v_idx_317 Int) (v_idx_318 Int)) (and (or (< v_idx_317 0) (and (<= (+ v_idx_318 1) v_idx_317) (<= 1 v_idx_317) (<= (+ c_r 1) v_idx_317) (<= 1 (+ v_idx_317 c_r))) (= 0 (select c_a v_idx_317)) (and (<= 1 v_idx_317) (<= (+ c_r 1) v_idx_317) (<= 1 (+ v_idx_317 c_r)))) (<= 0 c_r) (<= (- (- c_r) c_r) 0)))} [2019-01-31 15:04:53,414 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:04:53,415 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:04:53,415 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:04:53,647 WARN L270 ngHoareTripleChecker]: Pre: {89#(and (<= 0 i) (<= 0 (* 2 i)) (<= (- (- i) i) 0) (forall ((v_idx_313 Int)) (or (< v_idx_313 0) (<= i v_idx_313) (= (select a v_idx_313) 0))))} [2019-01-31 15:04:53,648 WARN L274 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-01-31 15:04:53,648 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) [2019-01-31 15:04:53,887 WARN L276 ngHoareTripleChecker]: Post: {90#(and (forall ((v_idx_317 Int)) (or (< v_idx_317 0) (<= 1 v_idx_317) (<= (+ r 1) v_idx_317) (= 0 (select a v_idx_317)))) (<= 0 r) (forall ((v_prenex_5 Int)) (or (<= (+ r 1) v_prenex_5) (< v_prenex_5 0) (= 0 (select a v_prenex_5)))) (<= (- (- r) r) 0) (forall ((v_prenex_2 Int)) (or (= 0 (select a v_prenex_2)) (< v_prenex_2 0) (<= 1 v_prenex_2))) (forall ((v_prenex_3 Int)) (or (<= 1 (+ v_prenex_3 r)) (= 0 (select a v_prenex_3)) (< v_prenex_3 0))) (forall ((v_prenex_4 Int)) (or (< v_prenex_4 0) (<= 1 v_prenex_4) (= 0 (select a v_prenex_4)) (<= 1 (+ v_prenex_4 r)))) (forall ((v_prenex_1 Int)) (or (< v_prenex_1 0) (= 0 (select a v_prenex_1)) (<= (+ r 1) v_prenex_1) (<= 1 (+ v_prenex_1 r)))))} [2019-01-31 15:04:53,888 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:04:53,888 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:04:53,889 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_272 [b_24] v_273 [b_25] v_274 [inf_0], [old(a)] -> [-inf_0] v_630 [inf_0], }, Substate: {ints: {b_25 = [0; inf]; b_24 = [0; 0]; v_273 = [0; 0]; i = [0; inf]}, 10 vars top, relations: {b_24 + b_25 = [0; inf]; b_24 - b_25 = [-inf; 0]; b_25 + v_273 = [0; inf]; b_25 - v_273 = [0; inf]; b_24 + v_273 = [0; 0]; b_24 - v_273 = [0; 0]; i + v_273 = [0; inf]; i - v_273 = [0; inf]; b_25 + i = [0; inf]; b_25 - i = [0; 0]; b_24 + i = [0; inf]; b_24 - i = [-inf; 0]}, }}} [2019-01-31 15:04:53,889 WARN L628 ntHoareTripleChecker]: (and (= c_i_primed (+ c_i 1)) (= c_a_primed (store c_a c_i 0)) (< c_i c_n)) (assume i < n;a := a[i := 0];i := i + 1;) [2019-01-31 15:04:53,890 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {[a] -> [-inf_0] v_272 [b_24] v_273 [b_25] v_274 [inf_0], }, Substate: {ints: {b_25 = [1; inf]; b_24 = [0; 0]; v_273 = [0; 0]; r = [0; inf]}, 2 vars top, relations: {b_24 + b_25 = [1; inf]; b_24 - b_25 = [-inf; -1]; b_25 + v_273 = [1; inf]; b_25 - v_273 = [1; inf]; b_24 + v_273 = [0; 0]; b_24 - v_273 = [0; 0]; r + v_273 = [0; inf]; r - v_273 = [0; inf]; b_25 + r = [1; inf]; b_25 - r = [1; inf]; b_24 + r = [0; inf]; b_24 - r = [-inf; 0]}, }}} [2019-01-31 15:04:53,890 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:04:53,965 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:04:53,965 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:04:53,966 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:04:53,966 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:04:53,966 WARN L224 ngHoareTripleChecker]: Pre: {93#(forall ((v_idx_320 Int)) (and (<= 0 c_i) (<= 0 (* 2 c_i)) (<= (- (- c_i) c_i) 0) (or (= 0 (select c_a v_idx_320)) (< v_idx_320 0) (<= c_i v_idx_320))))} [2019-01-31 15:04:53,966 WARN L228 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-01-31 15:04:53,967 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-01-31 15:04:53,967 WARN L230 ngHoareTripleChecker]: Post: {94#false} [2019-01-31 15:04:53,967 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:04:53,967 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:04:53,967 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:04:54,082 WARN L270 ngHoareTripleChecker]: Pre: {93#(and (<= 0 i) (<= 0 (* 2 i)) (<= (- (- i) i) 0) (forall ((v_idx_320 Int)) (or (= 0 (select a v_idx_320)) (< v_idx_320 0) (<= i v_idx_320))))} [2019-01-31 15:04:54,082 WARN L274 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-01-31 15:04:54,082 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-01-31 15:04:54,088 WARN L276 ngHoareTripleChecker]: Post: {94#false} [2019-01-31 15:04:54,088 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:04:54,088 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:04:54,088 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_272 [b_24] v_273 [b_25] v_274 [inf_0], [old(a)] -> [-inf_0] v_642 [inf_0], }, Substate: {ints: {b_25 = [0; inf]; b_24 = [0; 0]; v_273 = [0; 0]; i = [0; inf]}, 10 vars top, relations: {b_24 + b_25 = [0; inf]; b_24 - b_25 = [-inf; 0]; b_25 + v_273 = [0; inf]; b_25 - v_273 = [0; inf]; b_24 + v_273 = [0; 0]; b_24 - v_273 = [0; 0]; i + v_273 = [0; inf]; i - v_273 = [0; inf]; b_25 + i = [0; inf]; b_25 - i = [0; 0]; b_24 + i = [0; inf]; b_24 - i = [-inf; 0]}, }}} [2019-01-31 15:04:54,089 WARN L628 ntHoareTripleChecker]: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) (assume !(i < n);assume 0 <= r && r < n;) [2019-01-31 15:04:54,089 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:04:54,089 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:04:54,233 FATAL L765 sIntPredicateUnifier]: Invalid predicate! Predicate and state conjunction should be equal, but it is not. [2019-01-31 15:04:54,243 FATAL L766 sIntPredicateUnifier]: Pred: (and (forall ((v_idx_252 Int) (v_idx_253 Int)) (and (<= 0 (* 2 r)) (<= 0 r) (or (= (select a v_idx_252) 0) (and (<= 1 (+ r v_idx_252)) (<= 1 v_idx_252) (<= (+ r 1) v_idx_252) (<= (+ v_idx_253 1) v_idx_252)) (and (<= 1 (+ r v_idx_252)) (<= 1 v_idx_252) (<= (+ r 1) v_idx_252)) (< v_idx_252 0)))) (forall ((v_idx_243 Int)) (and (<= 0 i) (<= 0 (* 2 i)) (or (< v_idx_243 0) (= (select a v_idx_243) 0) (<= i v_idx_243))))) [2019-01-31 15:04:54,247 FATAL L769 sIntPredicateUnifier]: States: (forall ((v_idx_324 Int)) (and (<= (- (- i) r) 0) (<= 0 i) (<= 0 (* 2 i)) (<= (- (- i) i) 0) (<= 0 r) (or (< v_idx_324 0) (= 0 (select a v_idx_324)) (<= i v_idx_324)) (<= (- (- r) r) 0) (<= 0 (+ i r)))) [2019-01-31 15:04:54,247 FATAL L771 sIntPredicateUnifier]: Conjunctive states: [2019-01-31 15:04:54,248 FATAL L773 sIntPredicateUnifier]: #1{Arrays: {[a] -> [-inf_0] v_647 [b_60] v_648 [b_61] v_649 [inf_0], }, Substate: {ints: {v_648 = [0; 0]; r = [0; inf]; i = [0; inf]; b_61 = [0; inf]; b_60 = [0; 0]}, 3 vars top, relations: {r + v_648 = [0; inf]; r - v_648 = [0; inf]; i + v_648 = [0; inf]; i - v_648 = [0; inf]; b_61 + v_648 = [0; inf]; b_61 - v_648 = [0; inf]; b_60 + v_648 = [0; 0]; b_60 - v_648 = [0; 0]; i + r = [0; inf]; b_61 + r = [0; inf]; b_60 + r = [0; inf]; b_60 - r = [-inf; 0]; b_61 + i = [0; inf]; b_61 - i = [0; 0]; b_60 + i = [0; inf]; b_60 - i = [-inf; 0]; b_60 + b_61 = [0; inf]; b_60 - b_61 = [-inf; 0]}, }} [2019-01-31 15:04:54,295 FATAL L774 sIntPredicateUnifier]: (forall ((v_idx_327 Int)) (and (<= (- (- i) r) 0) (<= 0 i) (or (= (select a v_idx_327) 0) (<= i v_idx_327) (< v_idx_327 0)) (<= 0 (* 2 i)) (<= (- (- i) i) 0) (<= 0 r) (<= (- (- r) r) 0) (<= 0 (+ i r)))) [2019-01-31 15:04:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:04:54,297 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Created invalid predicate at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:713) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-31 15:04:54,301 INFO L168 Benchmark]: Toolchain (without parser) took 23753.54 ms. Allocated memory was 140.5 MB in the beginning and 489.2 MB in the end (delta: 348.7 MB). Free memory was 105.7 MB in the beginning and 196.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 258.1 MB. Max. memory is 7.1 GB. [2019-01-31 15:04:54,303 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:04:54,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.42 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 103.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-31 15:04:54,304 INFO L168 Benchmark]: Boogie Preprocessor took 21.64 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 102.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 15:04:54,305 INFO L168 Benchmark]: RCFGBuilder took 384.05 ms. Allocated memory is still 140.5 MB. Free memory was 102.6 MB in the beginning and 92.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-31 15:04:54,306 INFO L168 Benchmark]: TraceAbstraction took 23307.81 ms. Allocated memory was 140.5 MB in the beginning and 489.2 MB in the end (delta: 348.7 MB). Free memory was 92.3 MB in the beginning and 196.2 MB in the end (delta: -103.9 MB). Peak memory consumption was 244.7 MB. Max. memory is 7.1 GB. [2019-01-31 15:04:54,310 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.21 ms. Allocated memory is still 140.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.42 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 103.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.64 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 102.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 384.05 ms. Allocated memory is still 140.5 MB. Free memory was 102.6 MB in the beginning and 92.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23307.81 ms. Allocated memory was 140.5 MB in the beginning and 489.2 MB in the end (delta: 348.7 MB). Free memory was 92.3 MB in the beginning and 196.2 MB in the end (delta: -103.9 MB). Peak memory consumption was 244.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Created invalid predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Created invalid predicate: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:713) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...