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-1de736e-m [2019-02-18 09:53:40,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:53:40,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:53:40,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:53:40,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:53:40,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:53:40,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:53:40,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:53:40,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:53:40,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:53:40,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:53:40,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:53:40,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:53:40,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:53:41,008 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:53:41,009 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:53:41,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:53:41,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:53:41,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:53:41,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:53:41,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:53:41,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:53:41,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:53:41,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:53:41,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:53:41,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:53:41,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:53:41,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:53:41,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:53:41,036 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:53:41,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:53:41,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:53:41,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:53:41,038 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:53:41,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:53:41,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:53:41,041 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-02-18 09:53:41,060 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:53:41,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:53:41,062 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:53:41,062 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:53:41,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:53:41,062 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:53:41,062 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:53:41,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:53:41,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:53:41,063 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:53:41,063 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:53:41,064 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:53:41,064 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:53:41,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:53:41,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:53:41,065 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:53:41,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:53:41,065 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:53:41,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:53:41,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:53:41,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:53:41,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:53:41,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:53:41,068 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:53:41,068 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:53:41,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:53:41,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:53:41,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:53:41,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:53:41,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:53:41,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:53:41,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:53:41,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:53:41,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:53:41,070 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:53:41,070 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:53:41,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:53:41,070 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:53:41,070 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:53:41,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:53:41,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:53:41,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:53:41,119 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:53:41,120 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:53:41,121 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-02-18 09:53:41,121 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl' [2019-02-18 09:53:41,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:53:41,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:53:41,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:53:41,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:53:41,155 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:53:41,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,187 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-18 09:53:41,187 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-18 09:53:41,188 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-18 09:53:41,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:53:41,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:53:41,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:53:41,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:53:41,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/1) ... [2019-02-18 09:53:41,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:53:41,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:53:41,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:53:41,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:53:41,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (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-02-18 09:53:41,284 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-18 09:53:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-18 09:53:41,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-18 09:53:41,495 INFO L278 CfgBuilder]: Using library mode [2019-02-18 09:53:41,496 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-18 09:53:41,497 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:53:41 BoogieIcfgContainer [2019-02-18 09:53:41,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:53:41,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:53:41,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:53:41,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:53:41,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:41" (1/2) ... [2019-02-18 09:53:41,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38713927 and model type Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:53:41, skipping insertion in model container [2019-02-18 09:53:41,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:53:41" (2/2) ... [2019-02-18 09:53:41,505 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-WithArrays.bpl [2019-02-18 09:53:41,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:53:41,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:53:41,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:53:41,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:53:41,572 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:53:41,572 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:53:41,572 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:53:41,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:53:41,572 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:53:41,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:53:41,573 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:53:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-18 09:53:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:53:41,593 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:41,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:53:41,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-02-18 09:53:41,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:41,982 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-18 09:53:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:41,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:53:41,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:53:41,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:53:41,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:53:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:53:42,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:53:42,009 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-18 09:53:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:42,079 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-02-18 09:53:42,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:53:42,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:53:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:42,093 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:53:42,093 INFO L226 Difference]: Without dead ends: 5 [2019-02-18 09:53:42,097 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-02-18 09:53:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-18 09:53:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-18 09:53:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-18 09:53:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-18 09:53:42,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-18 09:53:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:42,133 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-18 09:53:42,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:53:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-18 09:53:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:53:42,134 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:42,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:53:42,134 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2019-02-18 09:53:42,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:42,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:42,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:42,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:42,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:42,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:53:42,364 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [9] [2019-02-18 09:53:42,419 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:53:42,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:53:44,517 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 09:53:44,519 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-02-18 09:53:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:44,528 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 09:53:44,644 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 09:53:44,799 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-18 09:53:44,799 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 09:53:44,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 09:53:44,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-18 09:53:44,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:53:44,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:53:44,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:53:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:53:44,806 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-18 09:53:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:44,954 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-18 09:53:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:53:44,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:53:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:44,955 INFO L225 Difference]: With dead ends: 5 [2019-02-18 09:53:44,956 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:53:44,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:53:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:53:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:53:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:53:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:53:44,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-02-18 09:53:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:44,958 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:53:44,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:53:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:53:44,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:53:44,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:53:45,010 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 30) no Hoare annotation was computed. [2019-02-18 09:53:45,010 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-02-18 09:53:45,010 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 11 30) no Hoare annotation was computed. [2019-02-18 09:53:45,010 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 30) no Hoare annotation was computed. [2019-02-18 09:53:45,011 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 28) the Hoare annotation is: (forall ((v_idx_19 Int) (v_idx_17 Int)) (let ((.cse9 (+ main_y 1))) (and (let ((.cse6 (select main_a v_idx_19))) (let ((.cse8 (< v_idx_19 main_x)) (.cse2 (<= (+ main_x 1) v_idx_19)) (.cse4 (<= 0 (* 2 .cse6)))) (let ((.cse0 (or .cse8 .cse2 (and .cse4 (<= 0 .cse6))))) (or (and (< v_idx_17 main_y) .cse0) (let ((.cse5 (select main_a v_idx_17))) (let ((.cse1 (<= (* 2 .cse5) 2000))) (and .cse1 (let ((.cse3 (<= .cse5 1000))) (or (and .cse1 .cse2 .cse3) (let ((.cse7 (+ .cse6 .cse5))) (and .cse4 (<= .cse5 (+ .cse6 1000)) (<= .cse7 1000) (<= 1000 .cse7))) (and .cse1 .cse8 .cse3)))))) (and (<= .cse9 v_idx_17) .cse0))))) (<= .cse9 main_x)))) [2019-02-18 09:53:45,012 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 27) no Hoare annotation was computed. [2019-02-18 09:53:45,033 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:53:45 BoogieIcfgContainer [2019-02-18 09:53:45,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 09:53:45,035 INFO L168 Benchmark]: Toolchain (without parser) took 3881.61 ms. Allocated memory was 135.8 MB in the beginning and 310.4 MB in the end (delta: 174.6 MB). Free memory was 109.5 MB in the beginning and 257.4 MB in the end (delta: -147.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-02-18 09:53:45,037 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:53:45,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.73 ms. Allocated memory is still 135.8 MB. Free memory was 109.3 MB in the beginning and 107.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-18 09:53:45,040 INFO L168 Benchmark]: Boogie Preprocessor took 22.25 ms. Allocated memory is still 135.8 MB. Free memory was 107.5 MB in the beginning and 106.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:53:45,041 INFO L168 Benchmark]: RCFGBuilder took 284.17 ms. Allocated memory is still 135.8 MB. Free memory was 106.4 MB in the beginning and 97.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-02-18 09:53:45,042 INFO L168 Benchmark]: TraceAbstraction took 3535.92 ms. Allocated memory was 135.8 MB in the beginning and 310.4 MB in the end (delta: 174.6 MB). Free memory was 97.3 MB in the beginning and 257.4 MB in the end (delta: -160.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-02-18 09:53:45,049 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.21 ms. Allocated memory is still 135.8 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.73 ms. Allocated memory is still 135.8 MB. Free memory was 109.3 MB in the beginning and 107.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.25 ms. Allocated memory is still 135.8 MB. Free memory was 107.5 MB in the beginning and 106.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 284.17 ms. Allocated memory is still 135.8 MB. Free memory was 106.4 MB in the beginning and 97.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3535.92 ms. Allocated memory was 135.8 MB in the beginning and 310.4 MB in the end (delta: 174.6 MB). Free memory was 97.3 MB in the beginning and 257.4 MB in the end (delta: -160.1 MB). Peak memory consumption was 14.5 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_19 : int, v_idx_17 : int :: (((v_idx_17 < y && ((v_idx_19 < x || x + 1 <= v_idx_19) || (0 <= 2 * a[v_idx_19] && 0 <= a[v_idx_19]))) || (2 * a[v_idx_17] <= 2000 && ((((2 * a[v_idx_17] <= 2000 && x + 1 <= v_idx_19) && a[v_idx_17] <= 1000) || (((0 <= 2 * a[v_idx_19] && a[v_idx_17] <= a[v_idx_19] + 1000) && a[v_idx_19] + a[v_idx_17] <= 1000) && 1000 <= a[v_idx_19] + a[v_idx_17])) || ((2 * a[v_idx_17] <= 2000 && v_idx_19 < x) && a[v_idx_17] <= 1000)))) || (y + 1 <= v_idx_17 && ((v_idx_19 < x || x + 1 <= v_idx_19) || (0 <= 2 * a[v_idx_19] && 0 <= a[v_idx_19])))) && y + 1 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.4s 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, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s 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, 2.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN 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.4s 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...