java -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/Luxembourg-WithArrays.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:02,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:02,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:02,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:02,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:02,430 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:02,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:02,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:02,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:02,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:02,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:02,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:02,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:02,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:02,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:02,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:02,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:02,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:02,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:02,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:02,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:02,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:02,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:02,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:02,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:02,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:02,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:02,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:02,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:02,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:02,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:02,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:02,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:02,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:02,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:02,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:02,464 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-03-04 16:53:02,489 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:02,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:02,490 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:02,491 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:02,491 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:02,491 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:02,491 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:02,491 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:02,492 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:02,495 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:02,495 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:02,496 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:02,496 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:02,497 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:02,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:02,497 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:02,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:02,497 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:02,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:02,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:02,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:02,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:02,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:02,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:02,499 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:02,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:02,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:02,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:02,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:02,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:02,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:02,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:02,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:02,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:02,503 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:02,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:02,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:02,504 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:02,504 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:02,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:02,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:02,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:02,566 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:02,566 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:02,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl [2019-03-04 16:53:02,568 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl' [2019-03-04 16:53:02,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:02,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:02,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:02,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:02,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:02,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,647 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:53:02,648 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:53:02,648 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:53:02,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:02,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:02,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:02,651 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:02,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... [2019-03-04 16:53:02,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:02,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:02,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:02,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:02,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:02,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-03-04 16:53:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:53:02,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:53:02,970 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:53:02,970 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-03-04 16:53:02,971 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:02 BoogieIcfgContainer [2019-03-04 16:53:02,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:02,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:02,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:02,976 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:02,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:02" (1/2) ... [2019-03-04 16:53:02,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d730b3d and model type Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:02, skipping insertion in model container [2019-03-04 16:53:02,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:02" (2/2) ... [2019-03-04 16:53:02,979 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-WithArrays.bpl [2019-03-04 16:53:02,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:02,999 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:53:03,017 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:53:03,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:03,061 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:03,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:03,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:03,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:03,062 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:03,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:03,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-03-04 16:53:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:03,098 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:03,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-03-04 16:53:03,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:03,509 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-03-04 16:53:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:03,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:03,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:53:03,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:03,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:03,536 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-03-04 16:53:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:03,631 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-03-04 16:53:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:03,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:03,646 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:53:03,647 INFO L226 Difference]: Without dead ends: 5 [2019-03-04 16:53:03,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-03-04 16:53:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-03-04 16:53:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-03-04 16:53:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-03-04 16:53:03,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-03-04 16:53:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:03,686 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-03-04 16:53:03,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-03-04 16:53:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:03,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:03,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,688 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-03-04 16:53:03,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:03,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:03,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:03,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:03,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:03,948 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-03-04 16:53:04,005 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:04,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:05,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:05,787 INFO L272 AbstractInterpreter]: Visited 4 different actions 30 times. Merged at 1 different actions 13 times. Widened at 1 different actions 9 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:05,793 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:06,055 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2019-03-04 16:53:06,056 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:06,218 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:53:06,219 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:06,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:06,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-03-04 16:53:06,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:06,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:06,223 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-03-04 16:53:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:06,380 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-03-04 16:53:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:06,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:53:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:06,381 INFO L225 Difference]: With dead ends: 5 [2019-03-04 16:53:06,382 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:53:06,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:53:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:53:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:53:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:53:06,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-03-04 16:53:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:06,386 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:53:06,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:53:06,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:53:06,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:53:06,434 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 27) no Hoare annotation was computed. [2019-03-04 16:53:06,434 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 30) no Hoare annotation was computed. [2019-03-04 16:53:06,434 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-03-04 16:53:06,435 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 11 30) no Hoare annotation was computed. [2019-03-04 16:53:06,435 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 30) no Hoare annotation was computed. [2019-03-04 16:53:06,436 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 28) the Hoare annotation is: (forall ((v_idx_47 Int) (v_idx_49 Int)) (let ((.cse9 (+ main_y 1))) (and (let ((.cse4 (select main_a v_idx_47))) (let ((.cse2 (<= (* 2 .cse4) 2000)) (.cse6 (< v_idx_47 main_y)) (.cse8 (<= .cse9 v_idx_47))) (let ((.cse0 (or (and .cse2 (<= .cse4 1000)) .cse6 .cse8))) (or (and .cse0 (< v_idx_49 main_x)) (let ((.cse5 (select main_a v_idx_49))) (let ((.cse1 (<= 0 (* 2 .cse5)))) (and .cse1 (let ((.cse7 (<= 0 .cse5))) (or (let ((.cse3 (+ .cse4 .cse5))) (and .cse2 (<= 1000 .cse3) (<= .cse3 1000) (<= .cse4 (+ .cse5 1000)))) (and .cse6 .cse1 .cse7) (and .cse1 .cse7 .cse8)))))) (and .cse0 (<= (+ main_x 1) v_idx_49)))))) (<= .cse9 main_x)))) [2019-03-04 16:53:06,450 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:53:06 BoogieIcfgContainer [2019-03-04 16:53:06,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:53:06,451 INFO L168 Benchmark]: Toolchain (without parser) took 3843.45 ms. Allocated memory was 133.2 MB in the beginning and 334.5 MB in the end (delta: 201.3 MB). Free memory was 107.1 MB in the beginning and 256.4 MB in the end (delta: -149.3 MB). Peak memory consumption was 52.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,457 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:53:06,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.66 ms. Allocated memory is still 133.2 MB. Free memory was 107.1 MB in the beginning and 105.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,460 INFO L168 Benchmark]: Boogie Preprocessor took 29.54 ms. Allocated memory is still 133.2 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,461 INFO L168 Benchmark]: RCFGBuilder took 290.39 ms. Allocated memory is still 133.2 MB. Free memory was 104.1 MB in the beginning and 95.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,463 INFO L168 Benchmark]: TraceAbstraction took 3478.44 ms. Allocated memory was 133.2 MB in the beginning and 334.5 MB in the end (delta: 201.3 MB). Free memory was 95.1 MB in the beginning and 256.4 MB in the end (delta: -161.4 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:06,470 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.66 ms. Allocated memory is still 133.2 MB. Free memory was 107.1 MB in the beginning and 105.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.54 ms. Allocated memory is still 133.2 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 290.39 ms. Allocated memory is still 133.2 MB. Free memory was 104.1 MB in the beginning and 95.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3478.44 ms. Allocated memory was 133.2 MB in the beginning and 334.5 MB in the end (delta: 201.3 MB). Free memory was 95.1 MB in the beginning and 256.4 MB in the end (delta: -161.4 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 21]: Loop Invariant Derived loop invariant: (forall v_idx_47 : int, v_idx_49 : int :: ((((((2 * a[v_idx_47] <= 2000 && a[v_idx_47] <= 1000) || v_idx_47 < y) || y + 1 <= v_idx_47) && v_idx_49 < x) || (0 <= 2 * a[v_idx_49] && (((((2 * a[v_idx_47] <= 2000 && 1000 <= a[v_idx_47] + a[v_idx_49]) && a[v_idx_47] + a[v_idx_49] <= 1000) && a[v_idx_47] <= a[v_idx_49] + 1000) || ((v_idx_47 < y && 0 <= 2 * a[v_idx_49]) && 0 <= a[v_idx_49])) || ((0 <= 2 * a[v_idx_49] && 0 <= a[v_idx_49]) && y + 1 <= v_idx_47)))) || ((((2 * a[v_idx_47] <= 2000 && a[v_idx_47] <= 1000) || v_idx_47 < y) || y + 1 <= v_idx_47) && x + 1 <= v_idx_49)) && y + 1 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 3 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s 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, 1.8s 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, 140 HoareAnnotationTreeSize, 1 FomulaSimplifications, 151 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 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...