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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:12:32,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:12:32,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:12:32,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:12:32,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:12:32,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:12:32,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:12:32,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:12:32,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:12:32,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:12:32,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:12:32,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:12:32,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:12:32,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:12:32,570 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:12:32,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:12:32,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:12:32,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:12:32,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:12:32,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:12:32,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:12:32,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:12:32,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:12:32,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:12:32,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:12:32,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:12:32,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:12:32,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:12:32,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:12:32,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:12:32,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:12:32,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:12:32,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:12:32,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:12:32,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:12:32,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:12:32,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-17 14:12:32,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:12:32,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:12:32,631 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:12:32,631 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:12:32,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:12:32,632 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:12:32,632 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:12:32,632 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-17 14:12:32,632 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:12:32,632 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-17 14:12:32,633 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-17 14:12:32,636 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:12:32,636 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:12:32,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:12:32,637 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:12:32,637 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:12:32,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:12:32,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:12:32,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:12:32,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:12:32,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:12:32,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:12:32,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:12:32,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:12:32,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:12:32,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:12:32,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:12:32,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:12:32,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:12:32,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:12:32,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:12:32,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:12:32,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:12:32,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:12:32,644 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:12:32,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:12:32,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:12:32,644 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:12:32,645 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:12:32,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:12:32,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:12:32,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:12:32,702 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:12:32,703 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:12:32,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2018-12-17 14:12:32,704 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2018-12-17 14:12:32,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:12:32,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:12:32,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:32,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:12:32,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:12:32,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:32,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:12:32,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:12:32,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:12:32,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/1) ... [2018-12-17 14:12:32,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:12:32,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:12:32,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:12:32,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:12:32,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (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 [2018-12-17 14:12:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-17 14:12:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-17 14:12:33,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-17 14:12:33,491 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-17 14:12:33,491 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:33 BoogieIcfgContainer [2018-12-17 14:12:33,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:12:33,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:12:33,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:12:33,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:12:33,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:32" (1/2) ... [2018-12-17 14:12:33,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d908e2b and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:33, skipping insertion in model container [2018-12-17 14:12:33,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:33" (2/2) ... [2018-12-17 14:12:33,499 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2018-12-17 14:12:33,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:12:33,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-17 14:12:33,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-17 14:12:33,564 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:12:33,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:12:33,565 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:12:33,565 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:12:33,565 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:12:33,565 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:12:33,565 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:12:33,566 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:12:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-17 14:12:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-17 14:12:33,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:33,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-17 14:12:33,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2018-12-17 14:12:33,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:33,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:33,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:33,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:33,897 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~post2, main_#t~post5, main_#t~post4, main_#t~post3, main_#t~post7, main_#t~post6, main_#t~post8, main_~string_entrada~5, main_~vetor_vogais~5, main_~i~5, main_~j~5, main_~cont~5, main_~tam_string~5, main_~n_caracter~5, main_~cont_aux~5;havoc main_~string_entrada~5;main_~vetor_vogais~5 := main_~vetor_vogais~5[0 := 97];main_~vetor_vogais~5 := main_~vetor_vogais~5[1 := 65];main_~vetor_vogais~5 := main_~vetor_vogais~5[2 := 101];main_~vetor_vogais~5 := main_~vetor_vogais~5[3 := 69];main_~vetor_vogais~5 := main_~vetor_vogais~5[4 := 105];main_~vetor_vogais~5 := main_~vetor_vogais~5[5 := 73];main_~vetor_vogais~5 := main_~vetor_vogais~5[6 := 111];main_~vetor_vogais~5 := main_~vetor_vogais~5[7 := 79];main_~vetor_vogais~5 := main_~vetor_vogais~5[8 := 117];main_~vetor_vogais~5 := main_~vetor_vogais~5[9 := 85];main_~vetor_vogais~5 := main_~vetor_vogais~5[10 := 0];havoc main_~i~5;havoc main_~j~5;havoc main_~cont~5;havoc main_~tam_string~5;havoc main_~n_caracter~5;main_~i~5 := 0; {12#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))} is VALID [2018-12-17 14:12:33,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))} assume !(main_~i~5 % 4294967296 < 10);main_~string_entrada~5 := main_~string_entrada~5[9 := 0];main_~n_caracter~5 := 0; {11#false} is VALID [2018-12-17 14:12:33,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} assume !(main_~string_entrada~5[main_~n_caracter~5 % 4294967296] != 0);main_~cont~5 := 0;main_~i~5 := 0;assume !(main_~i~5 % 4294967296 < main_~n_caracter~5 % 4294967296);main_~i~5 := 0;main_~cont_aux~5 := 0; {11#false} is VALID [2018-12-17 14:12:33,903 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !(main_~string_entrada~5[main_~i~5 % 4294967296] != 0);__VERIFIER_assert_#in~cond := (if main_~cont_aux~5 % 4294967296 == main_~cont~5 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2018-12-17 14:12:33,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {11#false} assume !false; {11#false} is VALID [2018-12-17 14:12:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:33,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:33,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-17 14:12:33,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:33,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-17 14:12:33,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:33,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:33,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:33,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:33,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:33,964 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-17 14:12:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:34,337 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-17 14:12:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:34,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-17 14:12:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-17 14:12:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-17 14:12:34,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-12-17 14:12:34,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:34,602 INFO L225 Difference]: With dead ends: 17 [2018-12-17 14:12:34,602 INFO L226 Difference]: Without dead ends: 12 [2018-12-17 14:12:34,606 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 [2018-12-17 14:12:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-17 14:12:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-12-17 14:12:34,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:34,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2018-12-17 14:12:34,688 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2018-12-17 14:12:34,688 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2018-12-17 14:12:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:34,691 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-17 14:12:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-12-17 14:12:34,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:34,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:34,693 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2018-12-17 14:12:34,693 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2018-12-17 14:12:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:34,695 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-17 14:12:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-12-17 14:12:34,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:34,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:34,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:34,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-17 14:12:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-12-17 14:12:34,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2018-12-17 14:12:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:34,701 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-12-17 14:12:34,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:12:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2018-12-17 14:12:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-17 14:12:34,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:34,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-17 14:12:34,702 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash 894129427, now seen corresponding path program 1 times [2018-12-17 14:12:34,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:34,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:34,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:34,987 INFO L273 TraceCheckUtils]: 0: Hoare triple {83#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~post2, main_#t~post5, main_#t~post4, main_#t~post3, main_#t~post7, main_#t~post6, main_#t~post8, main_~string_entrada~5, main_~vetor_vogais~5, main_~i~5, main_~j~5, main_~cont~5, main_~tam_string~5, main_~n_caracter~5, main_~cont_aux~5;havoc main_~string_entrada~5;main_~vetor_vogais~5 := main_~vetor_vogais~5[0 := 97];main_~vetor_vogais~5 := main_~vetor_vogais~5[1 := 65];main_~vetor_vogais~5 := main_~vetor_vogais~5[2 := 101];main_~vetor_vogais~5 := main_~vetor_vogais~5[3 := 69];main_~vetor_vogais~5 := main_~vetor_vogais~5[4 := 105];main_~vetor_vogais~5 := main_~vetor_vogais~5[5 := 73];main_~vetor_vogais~5 := main_~vetor_vogais~5[6 := 111];main_~vetor_vogais~5 := main_~vetor_vogais~5[7 := 79];main_~vetor_vogais~5 := main_~vetor_vogais~5[8 := 117];main_~vetor_vogais~5 := main_~vetor_vogais~5[9 := 85];main_~vetor_vogais~5 := main_~vetor_vogais~5[10 := 0];havoc main_~i~5;havoc main_~j~5;havoc main_~cont~5;havoc main_~tam_string~5;havoc main_~n_caracter~5;main_~i~5 := 0; {85#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))} is VALID [2018-12-17 14:12:34,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {85#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))} assume !!(main_~i~5 % 4294967296 < 10);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_entrada~5 := main_~string_entrada~5[main_~i~5 % 4294967296 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {86#(and (< 0 (+ (div ULTIMATE.start_main_~i~5 4294967296) 1)) (<= ULTIMATE.start_main_~i~5 1))} is VALID [2018-12-17 14:12:34,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {86#(and (< 0 (+ (div ULTIMATE.start_main_~i~5 4294967296) 1)) (<= ULTIMATE.start_main_~i~5 1))} assume !(main_~i~5 % 4294967296 < 10);main_~string_entrada~5 := main_~string_entrada~5[9 := 0];main_~n_caracter~5 := 0; {84#false} is VALID [2018-12-17 14:12:34,995 INFO L273 TraceCheckUtils]: 3: Hoare triple {84#false} assume !(main_~string_entrada~5[main_~n_caracter~5 % 4294967296] != 0);main_~cont~5 := 0;main_~i~5 := 0;assume !(main_~i~5 % 4294967296 < main_~n_caracter~5 % 4294967296);main_~i~5 := 0;main_~cont_aux~5 := 0; {84#false} is VALID [2018-12-17 14:12:34,996 INFO L273 TraceCheckUtils]: 4: Hoare triple {84#false} assume !(main_~string_entrada~5[main_~i~5 % 4294967296] != 0);__VERIFIER_assert_#in~cond := (if main_~cont_aux~5 % 4294967296 == main_~cont~5 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {84#false} is VALID [2018-12-17 14:12:34,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {84#false} assume !false; {84#false} is VALID [2018-12-17 14:12:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:34,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:12:34,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:12:34,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-17 14:12:35,001 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [23] [2018-12-17 14:12:35,043 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-17 14:12:35,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:12:35,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-17 14:12:35,426 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 1 different actions 3 times. Never widened. Performed 116 root evaluator evaluations with a maximum evaluation depth of 4. Performed 116 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-17 14:12:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:35,434 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-17 14:12:35,581 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 37.5% of their original sizes. [2018-12-17 14:12:35,591 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-17 14:12:35,648 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2018-12-17 14:12:35,685 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-17 14:12:35,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-17 14:12:35,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2018-12-17 14:12:35,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:35,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-17 14:12:35,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:35,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-17 14:12:35,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:35,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-17 14:12:35,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-17 14:12:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-17 14:12:35,748 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2018-12-17 14:12:36,337 WARN L207 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-17 14:12:36,337 WARN L212 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-17 14:12:36,338 WARN L214 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-17 14:12:36,339 WARN L218 ngHoareTripleChecker]: -- [2018-12-17 14:12:36,339 WARN L219 ngHoareTripleChecker]: Pre: {134#true} [2018-12-17 14:12:36,340 WARN L223 ngHoareTripleChecker]: Action: havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~post2, main_#t~post5, main_#t~post4, main_#t~post3, main_#t~post7, main_#t~post6, main_#t~post8, main_~string_entrada~5, main_~vetor_vogais~5, main_~i~5, main_~j~5, main_~cont~5, main_~tam_string~5, main_~n_caracter~5, main_~cont_aux~5;havoc main_~string_entrada~5;main_~vetor_vogais~5 := main_~vetor_vogais~5[0 := 97];main_~vetor_vogais~5 := main_~vetor_vogais~5[1 := 65];main_~vetor_vogais~5 := main_~vetor_vogais~5[2 := 101];main_~vetor_vogais~5 := main_~vetor_vogais~5[3 := 69];main_~vetor_vogais~5 := main_~vetor_vogais~5[4 := 105];main_~vetor_vogais~5 := main_~vetor_vogais~5[5 := 73];main_~vetor_vogais~5 := main_~vetor_vogais~5[6 := 111];main_~vetor_vogais~5 := main_~vetor_vogais~5[7 := 79];main_~vetor_vogais~5 := main_~vetor_vogais~5[8 := 117];main_~vetor_vogais~5 := main_~vetor_vogais~5[9 := 85];main_~vetor_vogais~5 := main_~vetor_vogais~5[10 := 0];havoc main_~i~5;havoc main_~j~5;havoc main_~cont~5;havoc main_~tam_string~5;havoc main_~n_caracter~5;main_~i~5 := 0; [2018-12-17 14:12:36,340 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store (store (store (store (store (store (store c_aux_v_ULTIMATE.start_main_~vetor_vogais~5_13 0 97) 1 65) 2 101) 3 69) 4 105) 5 73) 6 111) 7 79) 8 117) 9 85) 10 0) c_ULTIMATE.start_main_~vetor_vogais~5_primed) (= c_ULTIMATE.start_main_~i~5_primed 0)) [2018-12-17 14:12:36,341 WARN L225 ngHoareTripleChecker]: Post: {135#(= c_ULTIMATE.start_main_~n_caracter~5 0)} [2018-12-17 14:12:36,341 WARN L235 ngHoareTripleChecker]: -- [2018-12-17 14:12:36,341 WARN L237 ngHoareTripleChecker]: unsat core generation is disabled, enable it to get more details [2018-12-17 14:12:36,342 FATAL L613 ntHoareTripleChecker]: Check was UNKNOWN but should have been INVALID [2018-12-17 14:12:36,342 FATAL L616 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~tam_string~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~vetor_vogais~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~string_entrada~5 , Exp: TOP: ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~cont_aux~5, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~n_caracter~5, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~cont~5, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~tam_string~5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~vetor_vogais~5, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~j~5, ULTIMATE.start_main_~string_entrada~5 , }} [2018-12-17 14:12:36,343 FATAL L621 ntHoareTripleChecker]: (and (= (store (store (store (store (store (store (store (store (store (store (store c_aux_v_ULTIMATE.start_main_~vetor_vogais~5_13 0 97) 1 65) 2 101) 3 69) 4 105) 5 73) 6 111) 7 79) 8 117) 9 85) 10 0) c_ULTIMATE.start_main_~vetor_vogais~5_primed) (= c_ULTIMATE.start_main_~i~5_primed 0)) (havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~post2, main_#t~post5, main_#t~post4, main_#t~post3, main_#t~post7, main_#t~post6, main_#t~post8, main_~string_entrada~5, main_~vetor_vogais~5, main_~i~5, main_~j~5, main_~cont~5, main_~tam_string~5, main_~n_caracter~5, main_~cont_aux~5;havoc main_~string_entrada~5;main_~vetor_vogais~5 := main_~vetor_vogais~5[0 := 97];main_~vetor_vogais~5 := main_~vetor_vogais~5[1 := 65];main_~vetor_vogais~5 := main_~vetor_vogais~5[2 := 101];main_~vetor_vogais~5 := main_~vetor_vogais~5[3 := 69];main_~vetor_vogais~5 := main_~vetor_vogais~5[4 := 105];main_~vetor_vogais~5 := main_~vetor_vogais~5[5 := 73];main_~vetor_vogais~5 := main_~vetor_vogais~5[6 := 111];main_~vetor_vogais~5 := main_~vetor_vogais~5[7 := 79];main_~vetor_vogais~5 := main_~vetor_vogais~5[8 := 117];main_~vetor_vogais~5 := main_~vetor_vogais~5[9 := 85];main_~vetor_vogais~5 := main_~vetor_vogais~5[10 := 0];havoc main_~i~5;havoc main_~j~5;havoc main_~cont~5;havoc main_~tam_string~5;havoc main_~n_caracter~5;main_~i~5 := 0;) [2018-12-17 14:12:36,343 FATAL L622 ntHoareTripleChecker]: Post: {#1{Con: ULTIMATE.start_main_~n_caracter~5 = 0; , Exp: ULTIMATE.start_main_~n_caracter~5 = 0; , }} [2018-12-17 14:12:36,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-17 14:12:36,345 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Invalid hoare triple check at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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) [2018-12-17 14:12:36,414 INFO L168 Benchmark]: Toolchain (without parser) took 3657.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 688.4 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -736.2 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:36,417 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:36,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:36,420 INFO L168 Benchmark]: Boogie Preprocessor took 26.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:36,420 INFO L168 Benchmark]: RCFGBuilder took 666.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:36,421 INFO L168 Benchmark]: TraceAbstraction took 2919.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 688.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.3 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:36,427 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 666.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2919.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 688.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.3 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Invalid hoare triple check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Invalid hoare triple check: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:254) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...