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-fa1c628-m [2019-01-31 17:34:05,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:34:05,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:34:05,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:34:05,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:34:05,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:34:05,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:34:05,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:34:05,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:34:05,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:34:05,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:34:05,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:34:05,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:34:05,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:34:05,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:34:05,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:34:05,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:34:05,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:34:05,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:34:05,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:34:05,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:34:05,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:34:05,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:34:05,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:34:05,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:34:05,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:34:05,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:34:05,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:34:05,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:34:05,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:34:05,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:34:05,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:34:05,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:34:05,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:34:05,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:34:05,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:34:05,483 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-31 17:34:05,504 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:34:05,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:34:05,506 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:34:05,507 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:34:05,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:34:05,507 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:34:05,507 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:34:05,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:34:05,508 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:34:05,508 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:34:05,508 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:34:05,508 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:34:05,508 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:34:05,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:34:05,510 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:34:05,510 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:34:05,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:34:05,510 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:34:05,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:34:05,511 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:34:05,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:34:05,512 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:34:05,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:34:05,512 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:34:05,513 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:34:05,513 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:34:05,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:34:05,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:34:05,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:34:05,514 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:34:05,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:05,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:34:05,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:34:05,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:34:05,515 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:34:05,515 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:34:05,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:34:05,517 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:34:05,517 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:34:05,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:34:05,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:34:05,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:34:05,576 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:34:05,577 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:34:05,578 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-31 17:34:05,578 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-31 17:34:05,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:34:05,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:34:05,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:05,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:34:05,614 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:34:05,630 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,641 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:05,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:34:05,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:34:05,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:34:05,677 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,678 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,679 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,679 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,682 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,686 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,687 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 31.01 05:34:05" (1/1) ... [2019-01-31 17:34:05,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:34:05,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:34:05,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:34:05,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:34:05,690 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 31.01 05:34:05" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:05,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:34:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:34:06,004 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:34:06,005 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-31 17:34:06,006 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:06 BoogieIcfgContainer [2019-01-31 17:34:06,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:34:06,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:34:06,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:34:06,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:34:06,011 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 31.01 05:34:05" (1/2) ... [2019-01-31 17:34:06,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f15766 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:34:06, skipping insertion in model container [2019-01-31 17:34:06,012 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 31.01 05:34:06" (2/2) ... [2019-01-31 17:34:06,014 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-31 17:34:06,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:34:06,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-31 17:34:06,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-31 17:34:06,081 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:34:06,081 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:34:06,081 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:34:06,081 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:34:06,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:34:06,082 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:34:06,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:34:06,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:34:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-31 17:34:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:34:06,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:06,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:34:06,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:06,112 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-31 17:34:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:06,291 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-31 17:34:06,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:06,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:06,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:06,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:06,319 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-31 17:34:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:06,538 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-31 17:34:06,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:06,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:34:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:06,559 INFO L225 Difference]: With dead ends: 17 [2019-01-31 17:34:06,559 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:34:06,562 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-31 17:34:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:34:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-31 17:34:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:34:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-31 17:34:06,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-31 17:34:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:06,594 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-31 17:34:06,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-31 17:34:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:06,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:06,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:06,595 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-31 17:34:06,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:06,636 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-31 17:34:06,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:06,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:06,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:06,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:06,640 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-31 17:34:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:06,717 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 17:34:06,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:06,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:34:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:06,719 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:34:06,719 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:34:06,721 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-31 17:34:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:34:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-31 17:34:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:34:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-31 17:34:06,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-31 17:34:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:06,725 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-31 17:34:06,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-31 17:34:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:06,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:06,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:06,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-31 17:34:06,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:06,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:06,805 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-31 17:34:06,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:06,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:06,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:06,809 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-31 17:34:06,886 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:06,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:14,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:14,560 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-31 17:34:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:14,565 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:15,221 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-31 17:34:15,221 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:15,471 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-31 17:34:15,472 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:15,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:15,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-01-31 17:34:15,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:15,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:15,475 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 3 states. [2019-01-31 17:34:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:15,777 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2019-01-31 17:34:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:15,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:34:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:15,780 INFO L225 Difference]: With dead ends: 11 [2019-01-31 17:34:15,780 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 17:34:15,780 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-31 17:34:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 17:34:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-31 17:34:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:34:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-31 17:34:15,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-01-31 17:34:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:15,785 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-01-31 17:34:15,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-01-31 17:34:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:15,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:15,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:15,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-31 17:34:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:15,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:15,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:15,971 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-31 17:34:15,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:15,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:15,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:15,972 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-31 17:34:15,973 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:15,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:19,598 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:19,598 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-31 17:34:19,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:19,599 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:19,908 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 64.29% of their original sizes. [2019-01-31 17:34:19,908 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:20,079 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-31 17:34:20,080 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:20,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:20,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-31 17:34:20,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:20,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:20,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:20,082 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-01-31 17:34:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:20,891 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2019-01-31 17:34:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:20,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:34:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:20,892 INFO L225 Difference]: With dead ends: 16 [2019-01-31 17:34:20,892 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:34:20,893 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-31 17:34:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:34:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-01-31 17:34:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:34:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2019-01-31 17:34:20,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 3 [2019-01-31 17:34:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:20,898 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 22 transitions. [2019-01-31 17:34:20,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2019-01-31 17:34:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:20,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:20,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:20,899 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-31 17:34:20,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:20,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:20,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:20,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:20,924 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-31 17:34:20,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:20,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:20,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:20,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:20,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:20,926 INFO L87 Difference]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2019-01-31 17:34:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:20,963 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2019-01-31 17:34:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:20,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:34:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:20,965 INFO L225 Difference]: With dead ends: 14 [2019-01-31 17:34:20,965 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:34:20,966 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-31 17:34:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:34:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 17:34:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:34:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-01-31 17:34:20,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 4 [2019-01-31 17:34:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:20,971 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-01-31 17:34:20,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-01-31 17:34:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:20,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:20,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:20,972 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-31 17:34:20,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:20,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:20,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:21,154 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:34:21,227 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-31 17:34:21,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:21,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:21,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:21,229 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-31 17:34:21,230 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:21,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:25,080 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:25,080 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-31 17:34:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,081 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:25,642 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-01-31 17:34:25,642 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:26,006 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:34:26,007 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:26,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-31 17:34:26,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:26,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:26,009 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 4 states. [2019-01-31 17:34:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:26,924 INFO L93 Difference]: Finished difference Result 16 states and 28 transitions. [2019-01-31 17:34:26,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:26,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:34:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:26,925 INFO L225 Difference]: With dead ends: 16 [2019-01-31 17:34:26,925 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 17:34:26,926 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-31 17:34:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 17:34:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-01-31 17:34:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:34:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2019-01-31 17:34:26,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 4 [2019-01-31 17:34:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:26,930 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 25 transitions. [2019-01-31 17:34:26,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 25 transitions. [2019-01-31 17:34:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:26,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:26,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:26,931 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-31 17:34:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:26,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:27,071 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-31 17:34:27,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:27,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:27,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:27,072 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-31 17:34:27,074 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:27,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:36,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:36,729 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-31 17:34:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:36,729 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:37,392 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-01-31 17:34:37,393 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:37,635 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:34:37,635 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:37,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:37,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-31 17:34:37,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:37,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:37,638 INFO L87 Difference]: Start difference. First operand 12 states and 25 transitions. Second operand 4 states. [2019-01-31 17:34:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:42,490 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2019-01-31 17:34:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:42,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:34:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:42,491 INFO L225 Difference]: With dead ends: 19 [2019-01-31 17:34:42,491 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:34:42,492 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-31 17:34:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:34:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-01-31 17:34:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:34:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-01-31 17:34:42,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 4 [2019-01-31 17:34:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:42,498 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-01-31 17:34:42,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-01-31 17:34:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:42,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:42,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:42,499 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-31 17:34:42,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:42,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:42,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:42,649 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:34:42,661 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-31 17:34:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:42,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:42,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:42,662 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-31 17:34:42,663 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:42,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:45,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:45,782 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-31 17:34:45,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:45,783 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:46,088 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 57.14% of their original sizes. [2019-01-31 17:34:46,088 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:46,298 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:34:46,299 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:46,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:46,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-31 17:34:46,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:46,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:34:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:34:46,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:34:46,301 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 5 states. [2019-01-31 17:34:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:47,168 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2019-01-31 17:34:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:47,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:34:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:47,169 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:34:47,169 INFO L226 Difference]: Without dead ends: 18 [2019-01-31 17:34:47,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:34:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-31 17:34:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-01-31 17:34:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:34:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-01-31 17:34:47,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 4 [2019-01-31 17:34:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:47,178 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-01-31 17:34:47,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:34:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-01-31 17:34:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:47,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:47,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:47,179 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash 935378, now seen corresponding path program 1 times [2019-01-31 17:34:47,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:47,317 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-31 17:34:47,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:47,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:47,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:47,319 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-31 17:34:47,320 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:47,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:58,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:58,916 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:58,917 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:59,721 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 57.14% of their original sizes. [2019-01-31 17:34:59,721 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:59,887 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:34:59,887 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:59,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:59,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-31 17:34:59,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:59,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:34:59,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:34:59,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:34:59,889 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 5 states. [2019-01-31 17:35:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:00,794 INFO L93 Difference]: Finished difference Result 22 states and 45 transitions. [2019-01-31 17:35:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:00,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:35:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:00,795 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:35:00,795 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 17:35:00,796 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-31 17:35:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 17:35:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-31 17:35:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:35:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 37 transitions. [2019-01-31 17:35:00,806 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 37 transitions. Word has length 4 [2019-01-31 17:35:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:00,807 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 37 transitions. [2019-01-31 17:35:00,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:35:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 37 transitions. [2019-01-31 17:35:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:00,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:00,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:00,808 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-31 17:35:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:00,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:00,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:00,888 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-31 17:35:00,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:00,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:00,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:00,889 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-31 17:35:00,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:00,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:06,777 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:35:06,777 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-31 17:35:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:06,778 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:35:07,181 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-01-31 17:35:07,182 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:35:07,289 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 17:35:07,289 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:35:07,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:35:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-31 17:35:07,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:35:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:35:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:07,291 INFO L87 Difference]: Start difference. First operand 16 states and 37 transitions. Second operand 5 states. [2019-01-31 17:35:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:07,905 INFO L93 Difference]: Finished difference Result 24 states and 52 transitions. [2019-01-31 17:35:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:35:07,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 17:35:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:07,906 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:35:07,906 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:35:07,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:35:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-31 17:35:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:35:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-31 17:35:07,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 5 [2019-01-31 17:35:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:07,920 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-31 17:35:07,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:35:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-31 17:35:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:07,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:07,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:07,921 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-31 17:35:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:07,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:08,043 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-31 17:35:08,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:08,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:08,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:08,044 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-31 17:35:08,045 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:08,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:18,186 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:35:18,186 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-31 17:35:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:18,186 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:35:18,691 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-01-31 17:35:18,691 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:35:18,984 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 17:35:18,984 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:35:18,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:35:18,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-31 17:35:18,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:18,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:35:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:35:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:18,986 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 5 states. [2019-01-31 17:35:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:19,754 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. [2019-01-31 17:35:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:19,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 17:35:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:19,755 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:35:19,755 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:35:19,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:35:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-31 17:35:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:35:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-01-31 17:35:19,769 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 5 [2019-01-31 17:35:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:19,769 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-01-31 17:35:19,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:35:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-01-31 17:35:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:35:19,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:19,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:35:19,770 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash 28819754, now seen corresponding path program 1 times [2019-01-31 17:35:19,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:19,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:19,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:19,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:19,960 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-31 17:35:19,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:19,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:19,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:35:19,961 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-31 17:35:19,962 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:19,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:43,521 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:35:43,521 INFO L272 AbstractInterpreter]: Visited 5 different actions 61 times. Merged at 3 different actions 14 times. Widened at 3 different actions 10 times. Found 31 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:43,522 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:35:44,310 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 53.57% of their original sizes. [2019-01-31 17:35:44,310 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:35:44,572 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 17:35:44,572 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:35:44,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:35:44,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2019-01-31 17:35:44,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:44,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:35:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:35:44,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:44,574 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-01-31 17:35:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:45,138 INFO L93 Difference]: Finished difference Result 18 states and 42 transitions. [2019-01-31 17:35:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:45,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 17:35:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:45,138 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:35:45,138 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:35:45,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:35:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:35:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:35:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:35:45,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-31 17:35:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:45,140 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:35:45,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:35:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:35:45,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:35:45,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:35:45,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (forall ((v_idx_1098 Int) (v_idx_1096 Int) (v_idx_1094 Int)) (let ((.cse14 (+ ULTIMATE.start_main_p1 1)) (.cse15 (+ ULTIMATE.start_main_p2 1))) (and (let ((.cse12 (select |#memory_int| v_idx_1094)) (.cse5 (select |#memory_int| v_idx_1096))) (let ((.cse4 (<= (* 2 .cse5) 0)) (.cse8 (<= .cse5 .cse12)) (.cse11 (<= .cse15 v_idx_1096)) (.cse3 (< v_idx_1096 ULTIMATE.start_main_p2)) (.cse6 (<= 0 (* 2 .cse12))) (.cse9 (<= .cse14 v_idx_1094)) (.cse10 (< v_idx_1094 ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse13 (or .cse6 .cse9 .cse10))) (or (and .cse4 (or (and .cse6 .cse8) .cse9 .cse10)) (and .cse11 .cse13) (and .cse13 .cse3))))) (or (and .cse0 (< v_idx_1098 ULTIMATE.start_main_p3)) (and .cse0 (<= (+ ULTIMATE.start_main_p3 1) v_idx_1098)) (let ((.cse1 (select |#memory_int| v_idx_1098))) (and (<= 0 (* 2 .cse1)) (let ((.cse7 (<= 0 (+ .cse1 .cse12)))) (let ((.cse2 (or (and .cse6 .cse7) .cse9 .cse10))) (or (and .cse2 .cse3) (and .cse4 (<= .cse5 .cse1) (or (and .cse6 .cse7 .cse8) .cse9 .cse10)) (and .cse2 .cse11)))))))))) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= .cse14 ULTIMATE.start_main_p2) (<= .cse15 ULTIMATE.start_main_p3)))) [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-31 17:35:45,192 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-31 17:35:45,202 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:35:45 BoogieIcfgContainer [2019-01-31 17:35:45,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:35:45,203 INFO L168 Benchmark]: Toolchain (without parser) took 99591.18 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 108.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-01-31 17:35:45,204 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:35:45,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.57 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 106.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:35:45,206 INFO L168 Benchmark]: Boogie Preprocessor took 22.52 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:35:45,206 INFO L168 Benchmark]: RCFGBuilder took 317.81 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 95.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:35:45,207 INFO L168 Benchmark]: TraceAbstraction took 99195.08 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 94.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-01-31 17:35:45,212 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.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.57 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 106.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.52 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.81 ms. Allocated memory is still 141.0 MB. Free memory was 104.7 MB in the beginning and 95.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99195.08 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 94.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: 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_1098 : int, v_idx_1096 : int, v_idx_1094 : int :: ((((((((2 * #memory_int[v_idx_1096] <= 0 && (((0 <= 2 * #memory_int[v_idx_1094] && #memory_int[v_idx_1096] <= #memory_int[v_idx_1094]) || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1)) || (p2 + 1 <= v_idx_1096 && ((0 <= 2 * #memory_int[v_idx_1094] || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1))) || (((0 <= 2 * #memory_int[v_idx_1094] || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1) && v_idx_1096 < p2)) && v_idx_1098 < p3) || ((((2 * #memory_int[v_idx_1096] <= 0 && (((0 <= 2 * #memory_int[v_idx_1094] && #memory_int[v_idx_1096] <= #memory_int[v_idx_1094]) || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1)) || (p2 + 1 <= v_idx_1096 && ((0 <= 2 * #memory_int[v_idx_1094] || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1))) || (((0 <= 2 * #memory_int[v_idx_1094] || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1) && v_idx_1096 < p2)) && p3 + 1 <= v_idx_1098)) || (0 <= 2 * #memory_int[v_idx_1098] && ((((((0 <= 2 * #memory_int[v_idx_1094] && 0 <= #memory_int[v_idx_1098] + #memory_int[v_idx_1094]) || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1) && v_idx_1096 < p2) || ((2 * #memory_int[v_idx_1096] <= 0 && #memory_int[v_idx_1096] <= #memory_int[v_idx_1098]) && ((((0 <= 2 * #memory_int[v_idx_1094] && 0 <= #memory_int[v_idx_1098] + #memory_int[v_idx_1094]) && #memory_int[v_idx_1096] <= #memory_int[v_idx_1094]) || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1))) || ((((0 <= 2 * #memory_int[v_idx_1094] && 0 <= #memory_int[v_idx_1098] + #memory_int[v_idx_1094]) || p1 + 1 <= v_idx_1094) || v_idx_1094 < p1) && p2 + 1 <= v_idx_1096)))) && p1 + 2 <= p3) && p1 + 1 <= p2) && p2 + 1 <= p3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 99.1s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 40 SDslu, 1 SDs, 0 SdLazy, 84 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 79.2s AbstIntTime, 9 AbstIntIterations, 9 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 25 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 11 NumberOfFragments, 297 HoareAnnotationTreeSize, 1 FomulaSimplifications, 20841 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s 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...