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/eureka_01.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:51:49,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:51:49,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:51:49,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:51:49,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:51:49,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:51:49,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:51:49,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:51:49,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:51:49,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:51:49,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:51:49,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:51:49,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:51:49,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:51:49,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:51:49,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:51:49,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:51:49,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:51:49,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:51:49,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:51:49,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:51:49,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:51:49,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:51:49,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:51:49,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:51:49,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:51:49,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:51:49,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:51:49,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:51:49,213 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:51:49,213 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:51:49,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:51:49,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:51:49,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:51:49,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:51:49,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:51:49,218 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-08 13:51:49,243 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:51:49,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:51:49,244 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:51:49,244 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:51:49,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:51:49,245 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:51:49,246 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:51:49,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:51:49,246 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:51:49,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:51:49,246 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:51:49,247 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:51:49,247 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:51:49,247 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:51:49,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:51:49,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:51:49,249 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:51:49,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:51:49,250 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:51:49,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:51:49,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:51:49,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:51:49,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:51:49,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:51:49,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:51:49,253 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:51:49,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:51:49,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:51:49,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:51:49,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:51:49,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:51:49,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:51:49,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:51:49,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:51:49,255 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:51:49,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:51:49,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:51:49,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:51:49,256 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:51:49,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:51:49,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:51:49,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:51:49,320 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:51:49,321 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:51:49,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl [2019-01-08 13:51:49,322 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl' [2019-01-08 13:51:49,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:51:49,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:51:49,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:51:49,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:51:49,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:51:49,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:51:49,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:51:49,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:51:49,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:51:49,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (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-08 13:51:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:51:49,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:51:49,903 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:51:49,903 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-08 13:51:49,905 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49 BoogieIcfgContainer [2019-01-08 13:51:49,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:51:49,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:51:49,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:51:49,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:51:49,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/2) ... [2019-01-08 13:51:49,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455c5bad and model type eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:51:49, skipping insertion in model container [2019-01-08 13:51:49,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49" (2/2) ... [2019-01-08 13:51:49,915 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_3.bpl [2019-01-08 13:51:49,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:51:49,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:51:49,956 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:51:49,994 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:51:49,994 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:51:49,994 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:51:49,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:51:49,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:51:49,995 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:51:49,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:51:49,995 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:51:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 13:51:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 13:51:50,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 13:51:50,030 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-08 13:51:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,293 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-08 13:51:50,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:50,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:51:50,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:50,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:51:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:51:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:50,329 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-08 13:51:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,456 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-08 13:51:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:51:50,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 13:51:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,471 INFO L225 Difference]: With dead ends: 11 [2019-01-08 13:51:50,471 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 13:51:50,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 13:51:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 13:51:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-08 13:51:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-08 13:51:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-08 13:51:50,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-08 13:51:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,513 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-08 13:51:50,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:51:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-08 13:51:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 13:51:50,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 13:51:50,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-08 13:51:50,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:50,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:51:50,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:50,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:51:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:51:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:51:50,659 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-08 13:51:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,754 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-08 13:51:50,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:51:50,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 13:51:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,756 INFO L225 Difference]: With dead ends: 11 [2019-01-08 13:51:50,756 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 13:51:50,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:51:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 13:51:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 13:51:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 13:51:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-08 13:51:50,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-08 13:51:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,762 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-08 13:51:50,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:51:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-08 13:51:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:51:50,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 13:51:50,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-08 13:51:50,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,886 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-08 13:51:50,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:50,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 13:51:50,890 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-08 13:51:50,937 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:51:50,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:51:51,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:51:51,147 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 4 times. Never widened. Performed 370 root evaluator evaluations with a maximum evaluation depth of 4. Performed 370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 13:51:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:51:51,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,155 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-08 13:51:51,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 13:51:51,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:51:51,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:51:51,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-08 13:51:51,412 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-08 13:51:51,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-08 13:51:51,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:51:51,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:51:51,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2019-01-08 13:51:51,523 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-08 13:51:51,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2019-01-08 13:51:51,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:51:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:51:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-08 13:51:51,546 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-08 13:51:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,586 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-08 13:51:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:51:51,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 13:51:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,587 INFO L225 Difference]: With dead ends: 7 [2019-01-08 13:51:51,588 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 13:51:51,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-08 13:51:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 13:51:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 13:51:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 13:51:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 13:51:51,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-08 13:51:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,589 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 13:51:51,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:51:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 13:51:51,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 13:51:51,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 13:51:51,814 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-08 13:51:51,844 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 153) no Hoare annotation was computed. [2019-01-08 13:51:51,844 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 153) no Hoare annotation was computed. [2019-01-08 13:51:51,844 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 153) no Hoare annotation was computed. [2019-01-08 13:51:51,845 INFO L444 ceAbstractionStarter]: At program point L122(lines 105 122) the Hoare annotation is: (or (= 0 (select ULTIMATE.start_main_~distance~5 0)) (= ULTIMATE.start_main_~i~5 0)) [2019-01-08 13:51:51,845 INFO L444 ceAbstractionStarter]: At program point L150(lines 114 150) the Hoare annotation is: (or (= 0 (select ULTIMATE.start_main_~distance~5 0)) (and (= ULTIMATE.start_main_~i~5 0) (<= ULTIMATE.start_main_~nodecount~5 0))) [2019-01-08 13:51:51,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 152) no Hoare annotation was computed. [2019-01-08 13:51:51,845 INFO L444 ceAbstractionStarter]: At program point L141(lines 141 151) the Hoare annotation is: false [2019-01-08 13:51:51,857 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 01:51:51 BoogieIcfgContainer [2019-01-08 13:51:51,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 13:51:51,858 INFO L168 Benchmark]: Toolchain (without parser) took 2478.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -733.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-01-08 13:51:51,860 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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. [2019-01-08 13:51:51,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.86 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. [2019-01-08 13:51:51,861 INFO L168 Benchmark]: Boogie Preprocessor took 53.50 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. [2019-01-08 13:51:51,862 INFO L168 Benchmark]: RCFGBuilder took 424.35 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. [2019-01-08 13:51:51,863 INFO L168 Benchmark]: TraceAbstraction took 1950.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 13:51:51,867 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.22 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 44.86 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 53.50 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 424.35 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 1950.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: 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: 105]: Loop Invariant Derived loop invariant: 0 == main_~distance~5[0] || main_~i~5 == 0 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 == main_~distance~5[0] || (main_~i~5 == 0 && main_~nodecount~5 <= 0) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 1.8s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 20 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 23 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 5 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...