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_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:42:48,196 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:48,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:48,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:48,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:48,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:48,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:48,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:48,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:48,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:48,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:48,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:48,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:48,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:48,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:48,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:48,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:48,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:48,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:48,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:48,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:48,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:48,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:48,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:48,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:48,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:48,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:48,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:48,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:48,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:48,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:48,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:48,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:48,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:48,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:48,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:48,247 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-04 11:42:48,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:48,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:48,276 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:48,276 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:48,276 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:48,278 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:48,278 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:48,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:48,280 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:48,281 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:48,281 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:48,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:48,283 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:48,284 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:48,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:48,284 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:48,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:48,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:48,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:48,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:48,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:48,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:48,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:48,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:48,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:48,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:48,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:48,290 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:48,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:48,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:48,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:48,291 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:48,291 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:48,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:48,291 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:48,292 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:48,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:48,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:42:48,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:42:48,367 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:42:48,368 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:42:48,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-12-04 11:42:48,369 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-12-04 11:42:48,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:42:48,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:42:48,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:42:48,412 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:42:48,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:42:48,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:42:48,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:42:48,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:42:48,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:42:48,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:42:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:42:48,843 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:42:48,843 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-04 11:42:48,844 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48 BoogieIcfgContainer [2018-12-04 11:42:48,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:42:48,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:42:48,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:42:48,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:42:48,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/2) ... [2018-12-04 11:42:48,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc05676 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:42:48, skipping insertion in model container [2018-12-04 11:42:48,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48" (2/2) ... [2018-12-04 11:42:48,853 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-12-04 11:42:48,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:42:48,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:42:48,894 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:42:48,939 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:42:48,940 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:42:48,940 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:42:48,940 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:42:48,940 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:42:48,941 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:42:48,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:42:48,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:42:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 11:42:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:42:48,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:48,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:42:48,973 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:48,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:42:48,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,157 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-04 11:42:49,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:42:49,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:49,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:42:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:42:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:42:49,194 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-04 11:42:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,275 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-04 11:42:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:42:49,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:42:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,290 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:42:49,290 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:42:49,294 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-04 11:42:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:42:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:42:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:42:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-04 11:42:49,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-04 11:42:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,336 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-04 11:42:49,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:42:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-04 11:42:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:42:49,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-04 11:42:49,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2018-12-04 11:42:49,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,479 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-04 11:42:49,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:49,480 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-04 11:42:49,484 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2018-12-04 11:42:49,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:49,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:49,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-04 11:42:49,687 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-04 11:42:49,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,743 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-04 11:42:49,809 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-04 11:42:49,809 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-04 11:42:49,880 INFO L418 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-04 11:42:49,881 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-04 11:42:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-04 11:42:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-04 11:42:49,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:49,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:42:49,885 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-04 11:42:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,016 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-04 11:42:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:50,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-04 11:42:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,017 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:42:50,017 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:42:50,019 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:42:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:42:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-04 11:42:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:42:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-04 11:42:50,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-12-04 11:42:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,024 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-04 11:42:50,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-04 11:42:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:42:50,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:42:50,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2018-12-04 11:42:50,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:50,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,118 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-04 11:42:50,119 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2018-12-04 11:42:50,120 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:50,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:50,132 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-04 11:42:50,133 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 1 different actions 3 times. Never widened. Performed 82 root evaluator evaluations with a maximum evaluation depth of 4. Performed 82 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-04 11:42:50,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,142 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-04 11:42:50,152 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2018-12-04 11:42:50,153 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-04 11:42:50,216 INFO L418 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-04 11:42:50,216 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-04 11:42:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-04 11:42:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2018-12-04 11:42:50,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:50,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:42:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:42:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:42:50,218 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-12-04 11:42:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,326 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-04 11:42:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:42:50,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-04 11:42:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,327 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:42:50,327 INFO L226 Difference]: Without dead ends: 10 [2018-12-04 11:42:50,328 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:42:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-04 11:42:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-04 11:42:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:42:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-04 11:42:50,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-12-04 11:42:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,332 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-04 11:42:50,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:42:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-04 11:42:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:42:50,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:42:50,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2018-12-04 11:42:50,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:50,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,410 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-04 11:42:50,410 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2018-12-04 11:42:50,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:50,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:50,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:42:50,451 INFO L272 AbstractInterpreter]: Visited 8 different actions 30 times. Merged at 4 different actions 11 times. Widened at 1 different actions 2 times. Performed 344 root evaluator evaluations with a maximum evaluation depth of 4. Performed 344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-04 11:42:50,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:42:50,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,463 INFO L192 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 [2018-12-04 11:42:50,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:50,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:50,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:42:50,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:50,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:50,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:50,651 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-12-04 11:42:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,766 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-12-04 11:42:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:50,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-04 11:42:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,769 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:42:50,769 INFO L226 Difference]: Without dead ends: 10 [2018-12-04 11:42:50,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-04 11:42:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-04 11:42:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:42:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-04 11:42:50,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-12-04 11:42:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,779 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-04 11:42:50,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-04 11:42:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:42:50,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,780 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:42:50,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2018-12-04 11:42:50,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:50,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:50,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:50,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:50,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:50,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:50,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:50,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:50,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-04 11:42:51,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:42:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:42:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,040 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-04 11:42:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,079 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-04 11:42:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:42:51,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-04 11:42:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,082 INFO L225 Difference]: With dead ends: 17 [2018-12-04 11:42:51,082 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:42:51,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:42:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:42:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:42:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-04 11:42:51,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-12-04 11:42:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,088 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-04 11:42:51,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:42:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-04 11:42:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:42:51,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,089 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:42:51,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2018-12-04 11:42:51,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:51,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:51,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:51,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:51,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-04 11:42:51,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:42:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:42:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,432 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2018-12-04 11:42:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,467 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-12-04 11:42:51,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:42:51,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-04 11:42:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,468 INFO L225 Difference]: With dead ends: 18 [2018-12-04 11:42:51,468 INFO L226 Difference]: Without dead ends: 12 [2018-12-04 11:42:51,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-04 11:42:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-04 11:42:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:42:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-04 11:42:51,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-12-04 11:42:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,549 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-04 11:42:51,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:42:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-04 11:42:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-04 11:42:51,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,550 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:42:51,551 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,551 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2018-12-04 11:42:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:51,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:51,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-04 11:42:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-04 11:42:51,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:42:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:42:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,776 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-04 11:42:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,817 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-04 11:42:51,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:42:51,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-04 11:42:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,818 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:42:51,818 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:42:51,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:42:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:42:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:42:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-04 11:42:51,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-12-04 11:42:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,823 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-04 11:42:51,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:42:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-04 11:42:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:42:51,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,824 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:42:51,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2018-12-04 11:42:51,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:51,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:51,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:51,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:51,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-04 11:42:52,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-04 11:42:52,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-12-04 11:42:52,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:42:52,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:42:52,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-04 11:42:52,335 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2018-12-04 11:42:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:52,610 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-04 11:42:52,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:42:52,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-04 11:42:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:52,613 INFO L225 Difference]: With dead ends: 21 [2018-12-04 11:42:52,613 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:42:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-04 11:42:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:42:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:42:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:42:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-04 11:42:52,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2018-12-04 11:42:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:52,620 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-04 11:42:52,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:42:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-04 11:42:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:42:52,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:52,621 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-12-04 11:42:52,621 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:52,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2018-12-04 11:42:52,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-04 11:42:52,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:52,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-04 11:42:52,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:52,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:52,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:42:52,796 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2018-12-04 11:42:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:52,864 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-04 11:42:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:52,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-04 11:42:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:52,865 INFO L225 Difference]: With dead ends: 29 [2018-12-04 11:42:52,865 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:42:52,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:42:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:42:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:42:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:42:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-04 11:42:52,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2018-12-04 11:42:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:52,872 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-04 11:42:52,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-04 11:42:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:42:52,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:52,873 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-12-04 11:42:52,874 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:52,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2018-12-04 11:42:52,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-04 11:42:52,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:52,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:52,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:52,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:52,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:52,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-04 11:42:53,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-04 11:42:53,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-12-04 11:42:53,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:42:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:42:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:53,271 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2018-12-04 11:42:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,585 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-12-04 11:42:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:42:53,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-04 11:42:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,591 INFO L225 Difference]: With dead ends: 39 [2018-12-04 11:42:53,591 INFO L226 Difference]: Without dead ends: 26 [2018-12-04 11:42:53,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-04 11:42:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-04 11:42:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-04 11:42:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-04 11:42:53,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2018-12-04 11:42:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,601 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-04 11:42:53,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:42:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-04 11:42:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:42:53,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,602 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-12-04 11:42:53,603 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2018-12-04 11:42:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-04 11:42:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:53,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:53,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:53,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:53,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,787 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 [2018-12-04 11:42:53,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:53,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-04 11:42:53,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:42:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-04 11:42:53,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-04 11:42:54,072 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-04 11:42:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-12-04 11:42:54,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:54,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:54,074 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-12-04 11:42:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:54,125 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-04 11:42:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:54,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-04 11:42:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:54,126 INFO L225 Difference]: With dead ends: 26 [2018-12-04 11:42:54,126 INFO L226 Difference]: Without dead ends: 0 [2018-12-04 11:42:54,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-04 11:42:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-04 11:42:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-04 11:42:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-04 11:42:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-04 11:42:54,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-04 11:42:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:54,130 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-04 11:42:54,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-04 11:42:54,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-04 11:42:54,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-04 11:42:54,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-04 11:42:54,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-04 11:42:54,613 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-12-04 11:42:54,764 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-04 11:42:54,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-12-04 11:42:54,767 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-12-04 11:42:54,767 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (<= .cse4 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (= ~n 5))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse4 ~n)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n))))) [2018-12-04 11:42:54,767 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2018-12-04 11:42:54,767 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-12-04 11:42:54,768 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (= ~n 5)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse4 (<= ~n ULTIMATE.start_SelectionSort_~i~4))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_SelectionSort_~lh~4 0)) (and .cse0 .cse1 .cse2 (<= .cse3 ~n) .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4))) [2018-12-04 11:42:54,768 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (= ~n 5))) (or (and (<= 4 ULTIMATE.start_main_~i~7) .cse0) (and (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44))) .cse0))) [2018-12-04 11:42:54,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-04 11:42:54,779 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 11:42:54 BoogieIcfgContainer [2018-12-04 11:42:54,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-04 11:42:54,780 INFO L168 Benchmark]: Toolchain (without parser) took 6370.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -514.3 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. [2018-12-04 11:42:54,782 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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-04 11:42:54,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.31 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-04 11:42:54,783 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 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-04 11:42:54,783 INFO L168 Benchmark]: RCFGBuilder took 364.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-04 11:42:54,784 INFO L168 Benchmark]: TraceAbstraction took 5934.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -535.4 MB). Peak memory consumption was 183.9 MB. Max. memory is 7.1 GB. [2018-12-04 11:42:54,789 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.15 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 42.31 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 25.21 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 364.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5934.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -535.4 MB). Peak memory consumption was 183.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: 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: 46]: Loop Invariant Derived loop invariant: (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 == 0) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 + 1 <= ~n) && ~n <= SelectionSort_~i~4)) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~i~4) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (4 <= main_~i~7 && ~n == 5) || ((exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44) && ~n == 5) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 + 1 <= ~n) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~lh~4 + 2 <= ~n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 50 SDslu, 67 SDs, 0 SdLazy, 126 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, -0.7066666666666667 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 234 HoareAnnotationTreeSize, 4 FomulaSimplifications, 859 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 218 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 285 ConstructedInterpolants, 15 QuantifiedInterpolants, 12611 SizeOfPredicates, 15 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 415/494 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...