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-0302a3f [2019-02-27 13:17:48,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 13:17:48,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 13:17:48,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 13:17:48,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 13:17:48,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 13:17:48,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 13:17:48,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 13:17:48,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 13:17:48,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 13:17:48,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 13:17:48,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 13:17:48,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 13:17:48,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 13:17:48,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 13:17:48,066 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 13:17:48,067 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 13:17:48,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 13:17:48,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 13:17:48,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 13:17:48,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 13:17:48,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 13:17:48,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 13:17:48,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 13:17:48,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 13:17:48,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 13:17:48,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 13:17:48,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 13:17:48,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 13:17:48,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 13:17:48,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 13:17:48,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 13:17:48,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 13:17:48,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 13:17:48,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 13:17:48,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 13:17:48,088 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-27 13:17:48,111 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 13:17:48,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 13:17:48,113 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 13:17:48,113 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 13:17:48,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 13:17:48,114 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 13:17:48,114 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 13:17:48,114 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 13:17:48,114 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 13:17:48,114 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-27 13:17:48,115 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-27 13:17:48,116 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 13:17:48,116 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 13:17:48,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 13:17:48,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 13:17:48,117 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 13:17:48,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 13:17:48,117 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 13:17:48,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 13:17:48,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 13:17:48,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 13:17:48,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 13:17:48,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 13:17:48,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 13:17:48,120 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 13:17:48,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 13:17:48,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 13:17:48,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 13:17:48,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 13:17:48,121 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 13:17:48,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 13:17:48,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 13:17:48,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 13:17:48,122 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 13:17:48,122 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 13:17:48,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 13:17:48,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 13:17:48,123 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 13:17:48,123 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 13:17:48,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 13:17:48,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 13:17:48,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 13:17:48,196 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 13:17:48,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 13:17:48,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-02-27 13:17:48,198 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-02-27 13:17:48,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 13:17:48,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 13:17:48,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 13:17:48,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 13:17:48,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 13:17:48,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,269 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-27 13:17:48,269 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-27 13:17:48,269 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-27 13:17:48,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 13:17:48,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 13:17:48,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 13:17:48,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 13:17:48,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/1) ... [2019-02-27 13:17:48,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 13:17:48,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 13:17:48,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 13:17:48,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 13:17:48,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (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-02-27 13:17:48,359 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-27 13:17:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-27 13:17:48,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-27 13:17:48,751 INFO L278 CfgBuilder]: Using library mode [2019-02-27 13:17:48,752 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-27 13:17:48,753 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:17:48 BoogieIcfgContainer [2019-02-27 13:17:48,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 13:17:48,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 13:17:48,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 13:17:48,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 13:17:48,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:17:48" (1/2) ... [2019-02-27 13:17:48,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b20a80f and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 01:17:48, skipping insertion in model container [2019-02-27 13:17:48,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:17:48" (2/2) ... [2019-02-27 13:17:48,761 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-02-27 13:17:48,771 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 13:17:48,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-27 13:17:48,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-27 13:17:48,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 13:17:48,829 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 13:17:48,829 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 13:17:48,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 13:17:48,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 13:17:48,829 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 13:17:48,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 13:17:48,830 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 13:17:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-27 13:17:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 13:17:48,851 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:17:48,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 13:17:48,855 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:17:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:17:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-27 13:17:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:17:48,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:17:48,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:17:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:17:48,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:17:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:17:49,155 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0;assume j == i; {11#(= i 0)} is VALID [2019-02-27 13:17:49,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= i 0)} assume !(i < n);assume 0 <= r && r < n; {10#false} is VALID [2019-02-27 13:17:49,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[r] == 0); {10#false} is VALID [2019-02-27 13:17:49,176 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-27 13:17:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 13:17:49,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 13:17:49,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 13:17:49,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-27 13:17:49,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:17:49,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 13:17:49,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:17:49,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 13:17:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 13:17:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 13:17:49,253 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-27 13:17:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:17:49,518 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-27 13:17:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 13:17:49,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-27 13:17:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:17:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 13:17:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-27 13:17:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 13:17:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-02-27 13:17:49,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-02-27 13:17:49,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:17:49,604 INFO L225 Difference]: With dead ends: 11 [2019-02-27 13:17:49,604 INFO L226 Difference]: Without dead ends: 5 [2019-02-27 13:17:49,608 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-02-27 13:17:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-27 13:17:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-27 13:17:49,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:17:49,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-27 13:17:49,675 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-27 13:17:49,675 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-27 13:17:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:17:49,677 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 13:17:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 13:17:49,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:17:49,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:17:49,678 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-27 13:17:49,678 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-27 13:17:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:17:49,680 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 13:17:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 13:17:49,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:17:49,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:17:49,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:17:49,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:17:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 13:17:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-27 13:17:49,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-27 13:17:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:17:49,685 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-27 13:17:49,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 13:17:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 13:17:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 13:17:49,686 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:17:49,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 13:17:49,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:17:49,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:17:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-02-27 13:17:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:17:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:17:49,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:17:49,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:17:49,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:17:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:17:50,237 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-02-27 13:17:50,245 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0;assume j == i; {46#(= i 0)} is VALID [2019-02-27 13:17:50,249 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-02-27 13:17:50,250 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-02-27 13:17:50,255 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= r 0) (= 0 (select a r)))} assume !(a[r] == 0); {45#false} is VALID [2019-02-27 13:17:50,255 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-27 13:17:50,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:17:50,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:17:50,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-27 13:17:50,259 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-02-27 13:17:50,313 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-27 13:17:50,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 13:18:12,811 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-27 13:18:12,814 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-02-27 13:18:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:18:12,819 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-27 13:18:14,874 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 42.22% of their original sizes. [2019-02-27 13:18:14,933 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-27 13:18:15,302 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-27 13:18:15,818 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-27 13:18:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-27 13:18:15,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-27 13:18:15,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 13:18:15,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 13:18:15,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:18:15,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 13:18:15,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:18:15,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 13:18:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 13:18:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 13:18:15,874 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-27 13:18:15,915 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 13:18:15,916 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 13:18:15,917 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 13:18:15,918 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 13:18:15,918 WARN L224 ngHoareTripleChecker]: Pre: {87#(forall ((v_idx_305 Int)) (and (<= 0 c_i) (or (= (select c_a v_idx_305) 0) (< v_idx_305 0) (<= c_i v_idx_305)) (<= 0 (* 2 c_i)) (<= (- (- c_i) c_i) 0)))} [2019-02-27 13:18:15,919 WARN L228 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-02-27 13:18:15,920 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-02-27 13:18:15,920 WARN L230 ngHoareTripleChecker]: Post: {88#false} [2019-02-27 13:18:15,921 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 13:18:15,924 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 13:18:15,924 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 13:18:16,057 WARN L270 ngHoareTripleChecker]: Pre: {87#(and (<= 0 i) (<= 0 (* 2 i)) (forall ((v_idx_305 Int)) (or (= (select a v_idx_305) 0) (< v_idx_305 0) (<= i v_idx_305))) (<= (- (- i) i) 0))} [2019-02-27 13:18:16,058 WARN L274 ngHoareTripleChecker]: Action: assume i < n;a := a[i := 0];i := i + 1; [2019-02-27 13:18:16,058 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-02-27 13:18:16,060 WARN L276 ngHoareTripleChecker]: Post: {88#false} [2019-02-27 13:18:16,060 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 13:18:16,060 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 13:18:16,061 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_384 [b_27] v_385 [b_28] v_386 [inf_0], [old(a)] -> [-inf_0] v_738 [inf_0], }, Substate: {ints: {b_28 = [0; inf]; v_385 = [0; 0]; b_27 = [0; 0]; i = [0; inf]}, 10 vars top, relations: {b_27 + b_28 = [0; inf]; b_27 - b_28 = [-inf; 0]; b_28 + v_385 = [0; inf]; b_28 - v_385 = [0; inf]; b_27 + v_385 = [0; 0]; b_27 - v_385 = [0; 0]; i + v_385 = [0; inf]; i - v_385 = [0; inf]; b_28 + i = [0; inf]; b_28 - i = [0; 0]; b_27 + i = [0; inf]; b_27 - i = [-inf; 0]}, }}} [2019-02-27 13:18:16,062 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-02-27 13:18:16,062 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-02-27 13:18:16,062 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 13:18:16,599 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-27 13:18:16,600 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-27 13:18:16,601 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-27 13:18:16,601 WARN L223 ngHoareTripleChecker]: -- [2019-02-27 13:18:16,601 WARN L224 ngHoareTripleChecker]: Pre: {91#(forall ((v_idx_309 Int)) (and (or (= (select c_a v_idx_309) 0) (<= c_i v_idx_309) (< v_idx_309 0)) (<= 0 c_i) (<= 0 (* 2 c_i)) (<= (- (- c_i) c_i) 0)))} [2019-02-27 13:18:16,601 WARN L228 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-02-27 13:18:16,601 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-02-27 13:18:16,601 WARN L230 ngHoareTripleChecker]: Post: {92#false} [2019-02-27 13:18:16,602 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-27 13:18:16,602 WARN L268 ngHoareTripleChecker]: -- [2019-02-27 13:18:16,603 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-27 13:18:16,708 WARN L270 ngHoareTripleChecker]: Pre: {91#(and (<= 0 i) (forall ((v_idx_309 Int)) (or (= (select a v_idx_309) 0) (<= i v_idx_309) (< v_idx_309 0))) (<= 0 (* 2 i)) (<= (- (- i) i) 0))} [2019-02-27 13:18:16,708 WARN L274 ngHoareTripleChecker]: Action: assume !(i < n);assume 0 <= r && r < n; [2019-02-27 13:18:16,708 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_r c_n) (not (< c_i c_n)) (<= 0 c_r)) [2019-02-27 13:18:16,712 WARN L276 ngHoareTripleChecker]: Post: {92#false} [2019-02-27 13:18:16,712 WARN L620 ntHoareTripleChecker]: -- [2019-02-27 13:18:16,712 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-27 13:18:16,713 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[a] -> [-inf_0] v_384 [b_27] v_385 [b_28] v_386 [inf_0], [old(a)] -> [-inf_0] v_742 [inf_0], }, Substate: {ints: {b_28 = [0; inf]; v_385 = [0; 0]; b_27 = [0; 0]; i = [0; inf]}, 10 vars top, relations: {b_27 + b_28 = [0; inf]; b_27 - b_28 = [-inf; 0]; b_28 + v_385 = [0; inf]; b_28 - v_385 = [0; inf]; b_27 + v_385 = [0; 0]; b_27 - v_385 = [0; 0]; i + v_385 = [0; inf]; i - v_385 = [0; inf]; b_28 + i = [0; inf]; b_28 - i = [0; 0]; b_27 + i = [0; inf]; b_27 - i = [-inf; 0]}, }}} [2019-02-27 13:18:16,713 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-02-27 13:18:16,713 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-02-27 13:18:16,713 WARN L630 ntHoareTripleChecker]: -- [2019-02-27 13:18:17,087 FATAL L765 sIntPredicateUnifier]: Invalid predicate! Predicate and state conjunction should be equal, but it is not. [2019-02-27 13:18:17,097 FATAL L766 sIntPredicateUnifier]: Pred: (and (forall ((v_idx_261 Int) (v_idx_260 Int)) (and (<= 0 (* 2 r)) (<= 0 r) (or (= (select a v_idx_260) 0) (and (<= 1 v_idx_260) (<= 1 (+ v_idx_260 r)) (<= (+ r 1) v_idx_260) (<= (+ v_idx_261 1) v_idx_260)) (and (<= 1 v_idx_260) (<= 1 (+ v_idx_260 r)) (<= (+ r 1) v_idx_260)) (< v_idx_260 0)))) (forall ((v_idx_251 Int)) (and (<= 0 i) (<= 0 (* 2 i)) (or (< v_idx_251 0) (<= i v_idx_251) (= (select a v_idx_251) 0))))) [2019-02-27 13:18:17,101 FATAL L769 sIntPredicateUnifier]: States: (forall ((v_idx_313 Int)) (and (<= (- (- i) r) 0) (<= 0 i) (<= 0 (* 2 i)) (<= 0 r) (<= (- (- i) i) 0) (or (< v_idx_313 0) (<= i v_idx_313) (= (select a v_idx_313) 0)) (<= (- (- r) r) 0) (<= 0 (+ i r)))) [2019-02-27 13:18:17,101 FATAL L771 sIntPredicateUnifier]: Conjunctive states: [2019-02-27 13:18:17,101 FATAL L773 sIntPredicateUnifier]: #1{Arrays: {[a] -> [-inf_0] v_747 [b_61] v_748 [b_62] v_749 [inf_0], }, Substate: {ints: {b_61 = [0; 0]; v_748 = [0; 0]; b_62 = [0; inf]; r = [0; inf]; i = [0; inf]}, 3 vars top, relations: {b_61 + v_748 = [0; 0]; b_61 - v_748 = [0; 0]; b_62 + v_748 = [0; inf]; b_62 - v_748 = [0; inf]; r + v_748 = [0; inf]; r - v_748 = [0; inf]; i + v_748 = [0; inf]; i - v_748 = [0; inf]; b_61 + b_62 = [0; inf]; b_61 - b_62 = [-inf; 0]; b_61 + r = [0; inf]; b_61 - r = [-inf; 0]; b_62 + r = [0; inf]; i + r = [0; inf]; b_61 + i = [0; inf]; b_61 - i = [-inf; 0]; b_62 + i = [0; inf]; b_62 - i = [0; 0]}, }} [2019-02-27 13:18:17,141 FATAL L774 sIntPredicateUnifier]: (forall ((v_idx_316 Int)) (and (<= (- (- i) r) 0) (<= 0 i) (or (< v_idx_316 0) (<= i v_idx_316) (= (select a v_idx_316) 0)) (<= 0 (* 2 i)) (<= 0 r) (<= (- (- i) i) 0) (<= (- (- r) r) 0) (<= 0 (+ i r)))) [2019-02-27 13:18:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 13:18:17,143 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-02-27 13:18:17,146 INFO L168 Benchmark]: Toolchain (without parser) took 28910.60 ms. Allocated memory was 142.1 MB in the beginning and 495.5 MB in the end (delta: 353.4 MB). Free memory was 109.6 MB in the beginning and 339.8 MB in the end (delta: -230.2 MB). Peak memory consumption was 123.2 MB. Max. memory is 7.1 GB. [2019-02-27 13:18:17,148 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 13:18:17,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.11 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 107.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-02-27 13:18:17,149 INFO L168 Benchmark]: Boogie Preprocessor took 16.76 ms. Allocated memory is still 142.1 MB. Free memory was 107.6 MB in the beginning and 106.6 MB in the end (delta: 970.1 kB). Peak memory consumption was 970.1 kB. Max. memory is 7.1 GB. [2019-02-27 13:18:17,150 INFO L168 Benchmark]: RCFGBuilder took 464.48 ms. Allocated memory is still 142.1 MB. Free memory was 106.4 MB in the beginning and 96.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-27 13:18:17,151 INFO L168 Benchmark]: TraceAbstraction took 28391.43 ms. Allocated memory was 142.1 MB in the beginning and 495.5 MB in the end (delta: 353.4 MB). Free memory was 96.2 MB in the beginning and 339.8 MB in the end (delta: -243.5 MB). Peak memory consumption was 109.8 MB. Max. memory is 7.1 GB. [2019-02-27 13:18:17,155 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 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.11 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 107.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 16.76 ms. Allocated memory is still 142.1 MB. Free memory was 107.6 MB in the beginning and 106.6 MB in the end (delta: 970.1 kB). Peak memory consumption was 970.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 464.48 ms. Allocated memory is still 142.1 MB. Free memory was 106.4 MB in the beginning and 96.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28391.43 ms. Allocated memory was 142.1 MB in the beginning and 495.5 MB in the end (delta: 353.4 MB). Free memory was 96.2 MB in the beginning and 339.8 MB in the end (delta: -243.5 MB). Peak memory consumption was 109.8 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...