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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:37:59,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:37:59,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:37:59,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:37:59,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:37:59,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:37:59,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:37:59,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:37:59,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:37:59,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:37:59,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:37:59,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:37:59,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:37:59,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:37:59,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:37:59,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:37:59,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:37:59,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:37:59,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:37:59,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:37:59,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:37:59,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:37:59,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:37:59,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:37:59,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:37:59,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:37:59,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:37:59,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:37:59,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:37:59,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:37:59,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:37:59,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:37:59,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:37:59,521 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:37:59,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:37:59,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:37:59,524 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:37:59,537 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:37:59,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:37:59,538 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:37:59,539 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:37:59,539 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:37:59,539 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:37:59,539 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:37:59,539 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:37:59,540 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:37:59,540 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:37:59,540 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:37:59,540 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:37:59,540 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:37:59,541 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:37:59,541 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:37:59,541 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:37:59,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:37:59,542 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:37:59,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:37:59,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:37:59,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:37:59,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:37:59,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:37:59,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:37:59,543 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:37:59,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:37:59,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:37:59,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:37:59,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:37:59,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:37:59,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:37:59,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:37:59,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:37:59,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:37:59,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:37:59,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:37:59,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:37:59,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:37:59,546 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:37:59,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:37:59,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:37:59,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:37:59,627 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:37:59,628 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:37:59,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-01-20 10:37:59,629 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-20 10:37:59,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:37:59,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:37:59,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:37:59,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:37:59,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:37:59,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:37:59,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:37:59,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:37:59,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:37:59,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... [2019-01-20 10:37:59,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:37:59,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:37:59,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:37:59,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:37:59,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:37:59,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:37:59,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:38:00,093 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:38:00,094 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-20 10:38:00,095 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:00 BoogieIcfgContainer [2019-01-20 10:38:00,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:38:00,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:38:00,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:38:00,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:38:00,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:37:59" (1/2) ... [2019-01-20 10:38:00,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8253b5 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:38:00, skipping insertion in model container [2019-01-20 10:38:00,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:00" (2/2) ... [2019-01-20 10:38:00,104 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-20 10:38:00,113 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:38:00,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-20 10:38:00,132 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-20 10:38:00,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:38:00,158 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:38:00,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:38:00,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:38:00,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:38:00,159 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:38:00,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:38:00,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:38:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-20 10:38:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:38:00,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:00,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:38:00,183 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-20 10:38:00,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:00,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:00,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:00,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:00,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:00,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:00,373 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-20 10:38:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:00,552 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-20 10:38:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:00,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:38:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:00,568 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:38:00,568 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:38:00,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:38:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-20 10:38:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 10:38:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-20 10:38:00,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-20 10:38:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:00,602 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-20 10:38:00,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-20 10:38:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:00,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:00,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:00,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:00,604 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-20 10:38:00,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:00,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:00,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:00,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:00,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:00,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:00,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:00,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:00,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:00,643 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-20 10:38:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:00,729 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-20 10:38:00,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:00,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:00,730 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:38:00,730 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:38:00,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:38:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-20 10:38:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:38:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-20 10:38:00,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-20 10:38:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:00,735 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-20 10:38:00,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-20 10:38:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:00,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:00,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:00,737 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-20 10:38:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:00,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:00,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:00,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:00,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:00,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:00,811 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-20 10:38:00,884 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:00,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:08,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:08,004 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:38:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:08,010 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:08,915 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-20 10:38:08,915 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:09,296 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-20 10:38:09,297 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:09,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:09,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-01-20 10:38:09,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:09,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:09,300 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 3 states. [2019-01-20 10:38:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:09,661 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2019-01-20 10:38:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:09,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:09,663 INFO L225 Difference]: With dead ends: 11 [2019-01-20 10:38:09,663 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 10:38:09,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 10:38:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-20 10:38:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 10:38:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-20 10:38:09,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-01-20 10:38:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:09,670 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-01-20 10:38:09,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-01-20 10:38:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:09,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:09,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:09,672 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-20 10:38:09,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:09,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:09,885 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-20 10:38:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:09,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:09,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:09,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:09,908 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-20 10:38:09,909 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:09,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:14,200 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:14,201 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:38:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:14,201 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:14,567 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 64.29% of their original sizes. [2019-01-20 10:38:14,568 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:14,783 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-20 10:38:14,784 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:14,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-20 10:38:14,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:14,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:14,785 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-01-20 10:38:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:15,401 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2019-01-20 10:38:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:15,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:38:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:15,402 INFO L225 Difference]: With dead ends: 16 [2019-01-20 10:38:15,402 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 10:38:15,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 10:38:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-01-20 10:38:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:38:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2019-01-20 10:38:15,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 3 [2019-01-20 10:38:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:15,407 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 22 transitions. [2019-01-20 10:38:15,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2019-01-20 10:38:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:15,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:15,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:15,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-20 10:38:15,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:15,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:15,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:15,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:15,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:15,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:15,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:15,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:15,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:15,441 INFO L87 Difference]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2019-01-20 10:38:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:15,484 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2019-01-20 10:38:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:15,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:38:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:15,485 INFO L225 Difference]: With dead ends: 14 [2019-01-20 10:38:15,485 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:38:15,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:38:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 10:38:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:38:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-01-20 10:38:15,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 4 [2019-01-20 10:38:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:15,490 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-01-20 10:38:15,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-01-20 10:38:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:15,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:15,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:15,491 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-20 10:38:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:15,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:15,803 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-20 10:38:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:15,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:15,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:15,902 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:15,902 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-20 10:38:15,905 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:15,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:19,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:19,112 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:19,113 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:19,563 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-01-20 10:38:19,564 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:19,915 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:38:19,916 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:19,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:19,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-20 10:38:19,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:19,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:19,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:19,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:19,917 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 4 states. [2019-01-20 10:38:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:20,802 INFO L93 Difference]: Finished difference Result 16 states and 28 transitions. [2019-01-20 10:38:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:20,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:20,806 INFO L225 Difference]: With dead ends: 16 [2019-01-20 10:38:20,806 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 10:38:20,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 10:38:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-01-20 10:38:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:38:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2019-01-20 10:38:20,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 4 [2019-01-20 10:38:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:20,816 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 25 transitions. [2019-01-20 10:38:20,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 25 transitions. [2019-01-20 10:38:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:20,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:20,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:20,817 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-20 10:38:20,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:20,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:21,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:21,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:21,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:21,026 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-20 10:38:21,027 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:21,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:33,588 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:33,589 INFO L272 AbstractInterpreter]: Visited 4 different actions 34 times. Merged at 2 different actions 10 times. Widened at 2 different actions 6 times. Found 12 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:33,589 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:34,390 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-01-20 10:38:34,391 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:34,711 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:38:34,711 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:34,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:34,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-20 10:38:34,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:34,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:34,713 INFO L87 Difference]: Start difference. First operand 12 states and 25 transitions. Second operand 4 states. [2019-01-20 10:38:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:44,903 INFO L93 Difference]: Finished difference Result 20 states and 42 transitions. [2019-01-20 10:38:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:38:44,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:44,904 INFO L225 Difference]: With dead ends: 20 [2019-01-20 10:38:44,904 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 10:38:44,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 10:38:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-01-20 10:38:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:38:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 29 transitions. [2019-01-20 10:38:44,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 29 transitions. Word has length 4 [2019-01-20 10:38:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:44,913 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 29 transitions. [2019-01-20 10:38:44,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 29 transitions. [2019-01-20 10:38:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:44,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:44,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:44,914 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:44,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:44,915 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-20 10:38:44,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:44,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:44,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:44,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:44,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:44,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:44,976 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-20 10:38:44,977 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:44,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:47,937 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:47,938 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:47,938 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:48,391 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-20 10:38:48,391 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:48,603 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:38:48,603 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:48,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:48,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-20 10:38:48,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:48,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:48,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:48,604 INFO L87 Difference]: Start difference. First operand 13 states and 29 transitions. Second operand 4 states. [2019-01-20 10:38:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:49,328 INFO L93 Difference]: Finished difference Result 24 states and 48 transitions. [2019-01-20 10:38:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:38:49,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:49,329 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:38:49,329 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:38:49,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:38:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-20 10:38:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:38:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 36 transitions. [2019-01-20 10:38:49,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 36 transitions. Word has length 4 [2019-01-20 10:38:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:49,341 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 36 transitions. [2019-01-20 10:38:49,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 36 transitions. [2019-01-20 10:38:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:49,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:49,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:49,342 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash 935378, now seen corresponding path program 1 times [2019-01-20 10:38:49,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:49,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:49,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:49,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:49,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:49,499 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:38:49,720 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-20 10:38:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:49,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:49,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:49,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:49,731 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-20 10:38:49,732 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:49,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:58,844 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:38:58,844 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:58,845 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:38:59,283 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 57.14% of their original sizes. [2019-01-20 10:38:59,283 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:38:59,474 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-20 10:38:59,474 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:38:59,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:38:59,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-20 10:38:59,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:59,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:38:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:38:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:38:59,476 INFO L87 Difference]: Start difference. First operand 15 states and 36 transitions. Second operand 5 states. [2019-01-20 10:39:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:00,211 INFO L93 Difference]: Finished difference Result 24 states and 53 transitions. [2019-01-20 10:39:00,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:00,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-20 10:39:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:00,212 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:39:00,212 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 10:39:00,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 10:39:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-20 10:39:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:39:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 45 transitions. [2019-01-20 10:39:00,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 45 transitions. Word has length 4 [2019-01-20 10:39:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:00,226 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 45 transitions. [2019-01-20 10:39:00,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:39:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 45 transitions. [2019-01-20 10:39:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:00,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:00,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:00,227 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-20 10:39:00,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:00,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:00,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:00,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:00,297 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-20 10:39:00,298 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:00,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:05,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:39:05,785 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:05,785 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:39:06,339 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-20 10:39:06,339 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:39:06,502 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-20 10:39:06,503 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:39:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:39:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-20 10:39:06,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:06,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:06,504 INFO L87 Difference]: Start difference. First operand 18 states and 45 transitions. Second operand 4 states. [2019-01-20 10:39:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:07,310 INFO L93 Difference]: Finished difference Result 25 states and 56 transitions. [2019-01-20 10:39:07,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:39:07,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:39:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:07,311 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:39:07,311 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:39:07,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:39:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-20 10:39:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:39:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 47 transitions. [2019-01-20 10:39:07,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 47 transitions. Word has length 5 [2019-01-20 10:39:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:07,326 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 47 transitions. [2019-01-20 10:39:07,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 47 transitions. [2019-01-20 10:39:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:07,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:07,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:07,327 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-20 10:39:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:07,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:07,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:07,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:07,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:07,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:07,475 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-20 10:39:07,476 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:07,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:17,176 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:39:17,176 INFO L272 AbstractInterpreter]: Visited 5 different actions 29 times. Merged at 2 different actions 8 times. Widened at 2 different actions 5 times. Found 18 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:17,176 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:39:17,726 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-20 10:39:17,726 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:39:17,964 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-20 10:39:17,965 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:39:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:39:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-20 10:39:17,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:17,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:17,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:17,966 INFO L87 Difference]: Start difference. First operand 19 states and 47 transitions. Second operand 4 states. [2019-01-20 10:39:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:18,975 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. [2019-01-20 10:39:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:18,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:39:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:18,976 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:39:18,976 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:39:18,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:39:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-20 10:39:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:39:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-01-20 10:39:18,994 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 5 [2019-01-20 10:39:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:18,994 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-01-20 10:39:18,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-01-20 10:39:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:18,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:18,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:18,995 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28819754, now seen corresponding path program 1 times [2019-01-20 10:39:18,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:18,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:18,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:19,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:19,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:19,185 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-20 10:39:19,186 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:19,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:36,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-20 10:39:36,247 INFO L272 AbstractInterpreter]: Visited 5 different actions 53 times. Merged at 3 different actions 12 times. Widened at 3 different actions 8 times. Found 27 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:36,247 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-20 10:39:36,917 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-01-20 10:39:36,917 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-20 10:39:39,620 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-20 10:39:39,620 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-20 10:39:39,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-20 10:39:39,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-20 10:39:39,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:39,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:39:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:39:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:39,621 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-01-20 10:39:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:39,961 INFO L93 Difference]: Finished difference Result 18 states and 42 transitions. [2019-01-20 10:39:39,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:39,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-20 10:39:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:39,962 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:39:39,962 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:39:39,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:39:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:39:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:39:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:39:39,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-20 10:39:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:39,963 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:39:39,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:39:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:39:39,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:39:39,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:39:39,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:39:39,996 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (forall ((v_idx_1146 Int) (v_idx_1144 Int) (v_idx_1142 Int)) (let ((.cse14 (+ ULTIMATE.start_main_p1 1)) (.cse15 (+ ULTIMATE.start_main_p2 1))) (and (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (let ((.cse2 (select |#memory_int| v_idx_1144)) (.cse12 (select |#memory_int| v_idx_1142))) (let ((.cse10 (<= .cse15 v_idx_1144)) (.cse7 (<= .cse2 .cse12)) (.cse8 (<= (* 2 .cse2) 0)) (.cse11 (< v_idx_1144 ULTIMATE.start_main_p2)) (.cse3 (<= .cse14 v_idx_1142)) (.cse6 (<= 0 (* 2 .cse12))) (.cse4 (< v_idx_1142 ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse13 (or .cse3 .cse6 .cse4))) (or (and .cse13 .cse10) (and (or (and .cse6 .cse7) .cse3 .cse4) .cse8) (and .cse11 .cse13))))) (or (and .cse0 (< v_idx_1146 ULTIMATE.start_main_p3)) (let ((.cse1 (select |#memory_int| v_idx_1146))) (and (<= 0 (* 2 .cse1)) (let ((.cse5 (<= 0 (+ .cse1 .cse12)))) (let ((.cse9 (or .cse3 .cse4 (and .cse5 .cse6)))) (or (and (<= .cse2 .cse1) (or .cse3 .cse4 (and .cse5 .cse6 .cse7)) .cse8) (and .cse9 .cse10) (and .cse11 .cse9)))))) (and .cse0 (<= (+ ULTIMATE.start_main_p3 1) v_idx_1146)))))) (<= .cse14 ULTIMATE.start_main_p2) (<= .cse15 ULTIMATE.start_main_p3)))) [2019-01-20 10:39:39,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:39:39,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-20 10:39:39,996 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-01-20 10:39:39,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-20 10:39:39,997 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-20 10:39:39,997 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-20 10:39:39,997 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-01-20 10:39:40,007 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:39:40 BoogieIcfgContainer [2019-01-20 10:39:40,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:39:40,008 INFO L168 Benchmark]: Toolchain (without parser) took 100336.76 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 107.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 422.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:39:40,009 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.58 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:39:40,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.20 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:39:40,010 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 140.0 MB. Free memory was 105.2 MB in the beginning and 103.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:39:40,011 INFO L168 Benchmark]: RCFGBuilder took 339.38 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 94.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-01-20 10:39:40,012 INFO L168 Benchmark]: TraceAbstraction took 99909.34 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 408.5 MB. Max. memory is 7.1 GB. [2019-01-20 10:39:40,016 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.58 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.20 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 140.0 MB. Free memory was 105.2 MB in the beginning and 103.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.38 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 94.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99909.34 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 408.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (forall v_idx_1146 : int, v_idx_1144 : int, v_idx_1142 : int :: ((p1 + 2 <= p3 && ((((((((p1 + 1 <= v_idx_1142 || 0 <= 2 * #memory_int[v_idx_1142]) || v_idx_1142 < p1) && p2 + 1 <= v_idx_1144) || ((((0 <= 2 * #memory_int[v_idx_1142] && #memory_int[v_idx_1144] <= #memory_int[v_idx_1142]) || p1 + 1 <= v_idx_1142) || v_idx_1142 < p1) && 2 * #memory_int[v_idx_1144] <= 0)) || (v_idx_1144 < p2 && ((p1 + 1 <= v_idx_1142 || 0 <= 2 * #memory_int[v_idx_1142]) || v_idx_1142 < p1))) && v_idx_1146 < p3) || (0 <= 2 * #memory_int[v_idx_1146] && ((((#memory_int[v_idx_1144] <= #memory_int[v_idx_1146] && ((p1 + 1 <= v_idx_1142 || v_idx_1142 < p1) || ((0 <= #memory_int[v_idx_1146] + #memory_int[v_idx_1142] && 0 <= 2 * #memory_int[v_idx_1142]) && #memory_int[v_idx_1144] <= #memory_int[v_idx_1142]))) && 2 * #memory_int[v_idx_1144] <= 0) || (((p1 + 1 <= v_idx_1142 || v_idx_1142 < p1) || (0 <= #memory_int[v_idx_1146] + #memory_int[v_idx_1142] && 0 <= 2 * #memory_int[v_idx_1142])) && p2 + 1 <= v_idx_1144)) || (v_idx_1144 < p2 && ((p1 + 1 <= v_idx_1142 || v_idx_1142 < p1) || (0 <= #memory_int[v_idx_1146] + #memory_int[v_idx_1142] && 0 <= 2 * #memory_int[v_idx_1142])))))) || ((((((p1 + 1 <= v_idx_1142 || 0 <= 2 * #memory_int[v_idx_1142]) || v_idx_1142 < p1) && p2 + 1 <= v_idx_1144) || ((((0 <= 2 * #memory_int[v_idx_1142] && #memory_int[v_idx_1144] <= #memory_int[v_idx_1142]) || p1 + 1 <= v_idx_1142) || v_idx_1142 < p1) && 2 * #memory_int[v_idx_1144] <= 0)) || (v_idx_1144 < p2 && ((p1 + 1 <= v_idx_1142 || 0 <= 2 * #memory_int[v_idx_1142]) || v_idx_1142 < p1))) && p3 + 1 <= v_idx_1146))) && p1 + 1 <= p2) && p2 + 1 <= p3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 99.8s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 40 SDslu, 1 SDs, 0 SdLazy, 95 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 71.5s AbstIntTime, 9 AbstIntIterations, 9 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 11 NumberOfFragments, 297 HoareAnnotationTreeSize, 1 FomulaSimplifications, 26966 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...