java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:10:32,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:10:32,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:10:32,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:10:32,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:10:32,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:10:32,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:10:32,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:10:32,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:10:32,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:10:32,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:10:32,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:10:32,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:10:32,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:10:32,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:10:32,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:10:32,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:10:32,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:10:32,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:10:32,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:10:32,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:10:32,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:10:32,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:10:32,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:10:32,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:10:32,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:10:32,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:10:32,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:10:32,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:10:32,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:10:32,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:10:32,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:10:32,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:10:32,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:10:32,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:10:32,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:10:32,192 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 [2019-01-11 14:10:32,204 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:10:32,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:10:32,205 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:10:32,205 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:10:32,206 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:10:32,206 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:10:32,206 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:10:32,206 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:10:32,206 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:10:32,207 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:10:32,207 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:10:32,207 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:10:32,207 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:10:32,207 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:10:32,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:10:32,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:10:32,208 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:10:32,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:10:32,209 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:10:32,209 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:10:32,209 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:10:32,209 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:10:32,210 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:10:32,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:10:32,210 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:10:32,210 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:10:32,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:10:32,211 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:10:32,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:10:32,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:10:32,211 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:10:32,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:32,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:10:32,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:10:32,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:10:32,212 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:10:32,212 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:10:32,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:10:32,213 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:10:32,213 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:10:32,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:10:32,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:10:32,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:10:32,259 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:10:32,259 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:10:32,260 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 [2019-01-11 14:10:32,260 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-01-11 14:10:32,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:10:32,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:10:32,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:32,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:10:32,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:10:32,322 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 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,333 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 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:32,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:10:32,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:10:32,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:10:32,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:10:32,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:10:32,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:10:32,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:10:32,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10: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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:10:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:10:32,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:10:32,777 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-11 14:10:32,779 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:10:32,779 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 14:10:32,781 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:32 BoogieIcfgContainer [2019-01-11 14:10:32,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:10:32,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:10:32,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:10:32,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:10:32,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/2) ... [2019-01-11 14:10:32,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1789a9 and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:10:32, skipping insertion in model container [2019-01-11 14:10:32,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:32" (2/2) ... [2019-01-11 14:10:32,789 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2019-01-11 14:10:32,799 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:10:32,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:10:32,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:10:32,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:10:32,921 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:10:32,921 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:10:32,921 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:10:32,921 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:10:32,921 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:10:32,922 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:10:32,922 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:10:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 14:10:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:10:32,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:32,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:10:32,950 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:32,959 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-01-11 14:10:32,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:33,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:33,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:33,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:33,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:10:33,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:33,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:10:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:10:33,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:33,209 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 14:10:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:33,288 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-01-11 14:10:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:10:33,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-11 14:10:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:33,303 INFO L225 Difference]: With dead ends: 17 [2019-01-11 14:10:33,303 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:10:33,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:10:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-11 14:10:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:10:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-11 14:10:33,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-01-11 14:10:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:33,344 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-11 14:10:33,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:10:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-01-11 14:10:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:10:33,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:33,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:10:33,345 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 894129427, now seen corresponding path program 1 times [2019-01-11 14:10:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:33,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:33,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:33,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:10:33,496 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [23] [2019-01-11 14:10:33,537 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:33,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:33,694 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-11 14:10:33,696 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. [2019-01-11 14:10:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:33,708 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-11 14:10:33,775 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 37.5% of their original sizes. [2019-01-11 14:10:33,778 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-11 14:10:33,856 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-01-11 14:10:33,856 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-11 14:10:33,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 14:10:33,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-01-11 14:10:33,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:33,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:33,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:33,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:10:33,860 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2019-01-11 14:10:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,121 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2019-01-11 14:10:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:34,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 14:10:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,123 INFO L225 Difference]: With dead ends: 19 [2019-01-11 14:10:34,123 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:10:34,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:10:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:10:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 9. [2019-01-11 14:10:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:10:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-11 14:10:34,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-01-11 14:10:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,128 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-11 14:10:34,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-11 14:10:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:10:34,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:34,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash 264986107, now seen corresponding path program 1 times [2019-01-11 14:10:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:10:34,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:34,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:34,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:10:34,386 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [21], [23], [29] [2019-01-11 14:10:34,388 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:34,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:34,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-11 14:10:34,404 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 3 times. Never widened. Performed 121 root evaluator evaluations with a maximum evaluation depth of 5. Performed 121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:10:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,404 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-11 14:10:34,414 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 30% of their original sizes. [2019-01-11 14:10:34,415 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-11 14:10:34,480 INFO L420 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2019-01-11 14:10:34,481 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-11 14:10:34,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 14:10:34,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2019-01-11 14:10:34,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:34,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:10:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:10:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:10:34,484 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 5 states. [2019-01-11 14:10:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,732 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-01-11 14:10:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:10:34,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 14:10:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,734 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:10:34,734 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:10:34,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:10:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:10:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 10. [2019-01-11 14:10:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 14:10:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-11 14:10:34,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2019-01-11 14:10:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,739 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-11 14:10:34,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:10:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-01-11 14:10:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:10:34,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:34,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash -375296184, now seen corresponding path program 1 times [2019-01-11 14:10:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:10:34,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:34,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:34,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:10:34,975 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [21], [23], [29], [31] [2019-01-11 14:10:34,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:34,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:35,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:35,016 INFO L272 AbstractInterpreter]: Visited 9 different actions 34 times. Merged at 7 different actions 16 times. Widened at 1 different actions 1 times. Performed 392 root evaluator evaluations with a maximum evaluation depth of 5. Performed 392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:10:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:35,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:35,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:35,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:35,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:10:35,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:35,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2019-01-11 14:10:35,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:35,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:10:35,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:5 [2019-01-11 14:10:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:10:35,315 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-01-11 14:10:35,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [3] total 8 [2019-01-11 14:10:35,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:35,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:10:35,316 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2019-01-11 14:10:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:35,370 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-11 14:10:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:35,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-11 14:10:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:35,371 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:10:35,371 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:10:35,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:10:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:10:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:10:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:10:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:10:35,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-11 14:10:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:35,373 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:10:35,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:10:35,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:10:35,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:10:35,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 124) no Hoare annotation was computed. [2019-01-11 14:10:35,437 INFO L451 ceAbstractionStarter]: At program point L83(lines 54 83) the Hoare annotation is: true [2019-01-11 14:10:35,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) no Hoare annotation was computed. [2019-01-11 14:10:35,437 INFO L444 ceAbstractionStarter]: At program point L96(lines 96 101) the Hoare annotation is: false [2019-01-11 14:10:35,437 INFO L451 ceAbstractionStarter]: At program point L63(lines 44 63) the Hoare annotation is: true [2019-01-11 14:10:35,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 124) no Hoare annotation was computed. [2019-01-11 14:10:35,437 INFO L444 ceAbstractionStarter]: At program point L123(lines 100 123) the Hoare annotation is: false [2019-01-11 14:10:35,437 INFO L444 ceAbstractionStarter]: At program point L113(lines 77 113) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= (select ULTIMATE.start_main_~string_entrada~5 0) 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0)) [2019-01-11 14:10:35,443 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:10:35 BoogieIcfgContainer [2019-01-11 14:10:35,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:10:35,444 INFO L168 Benchmark]: Toolchain (without parser) took 3140.95 ms. Allocated memory was 139.5 MB in the beginning and 223.3 MB in the end (delta: 83.9 MB). Free memory was 107.5 MB in the beginning and 178.6 MB in the end (delta: -71.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-01-11 14:10:35,446 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory is still 109.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:10:35,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 139.5 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-11 14:10:35,448 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 104.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:10:35,449 INFO L168 Benchmark]: RCFGBuilder took 413.82 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 93.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-01-11 14:10:35,450 INFO L168 Benchmark]: TraceAbstraction took 2661.78 ms. Allocated memory was 139.5 MB in the beginning and 223.3 MB in the end (delta: 83.9 MB). Free memory was 93.1 MB in the beginning and 178.6 MB in the end (delta: -85.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:10:35,455 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory is still 109.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 139.5 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.56 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 104.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.82 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 93.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2661.78 ms. Allocated memory was 139.5 MB in the beginning and 223.3 MB in the end (delta: 83.9 MB). Free memory was 93.1 MB in the beginning and 178.6 MB in the end (delta: -85.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~string_entrada~5[0] == 0) && main_~cont_aux~5 == 0) && main_~i~5 == 0 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 23 SDslu, 12 SDs, 0 SdLazy, 27 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.6291666666666667 AbsIntWeakeningRatio, 1.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.5 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 19 HoareAnnotationTreeSize, 5 FomulaSimplifications, 150 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 786 SizeOfPredicates, 5 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 9/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...