java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:14:40,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:14:40,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:14:40,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:14:40,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:14:40,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:14:40,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:14:40,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:14:40,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:14:40,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:14:40,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:14:40,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:14:40,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:14:40,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:14:40,553 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:14:40,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:14:40,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:14:40,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:14:40,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:14:40,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:14:40,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:14:40,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:14:40,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:14:40,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:14:40,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:14:40,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:14:40,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:14:40,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:14:40,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:14:40,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:14:40,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:14:40,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:14:40,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:14:40,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:14:40,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:14:40,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:14:40,576 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:14:40,589 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:14:40,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:14:40,592 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:14:40,592 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:14:40,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:14:40,592 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:14:40,592 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:14:40,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:14:40,593 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:14:40,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:14:40,593 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:14:40,593 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:14:40,594 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:14:40,594 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:14:40,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:14:40,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:14:40,595 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:14:40,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:14:40,596 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:14:40,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:14:40,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:14:40,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:14:40,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:14:40,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:14:40,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:14:40,598 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:14:40,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:14:40,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:14:40,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:14:40,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:14:40,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:14:40,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:14:40,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:14:40,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:14:40,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:14:40,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:14:40,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:14:40,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:14:40,603 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:14:40,603 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:14:40,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:14:40,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:14:40,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:14:40,666 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:14:40,667 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:14:40,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-02-25 15:14:40,668 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-02-25 15:14:40,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:14:40,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:14:40,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:14:40,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:14:40,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:14:40,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:14:40,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:14:40,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:14:40,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:14:40,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... [2019-02-25 15:14:40,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:14:40,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:14:40,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:14:40,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:14:40,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:14:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:14:40,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:14:41,099 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:14:41,100 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-25 15:14:41,101 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:14:41 BoogieIcfgContainer [2019-02-25 15:14:41,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:14:41,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:14:41,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:14:41,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:14:41,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:14:40" (1/2) ... [2019-02-25 15:14:41,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35bb8a95 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:14:41, skipping insertion in model container [2019-02-25 15:14:41,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:14:41" (2/2) ... [2019-02-25 15:14:41,109 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-02-25 15:14:41,118 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:14:41,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-25 15:14:41,142 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-25 15:14:41,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:14:41,172 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:14:41,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:14:41,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:14:41,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:14:41,173 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:14:41,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:14:41,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:14:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-25 15:14:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:14:41,192 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:41,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:14:41,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-25 15:14:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:41,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:41,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:14:41,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:14:41,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:14:41,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:14:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:14:41,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:14:41,390 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-25 15:14:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:41,595 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-25 15:14:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:14:41,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:14:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:41,611 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:14:41,611 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:14:41,614 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-02-25 15:14:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:14:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-25 15:14:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:14:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-25 15:14:41,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-25 15:14:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:41,646 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-25 15:14:41,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:14:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-25 15:14:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:14:41,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:41,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:14:41,647 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-25 15:14:41,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:41,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:41,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:41,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:41,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:41,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:14:41,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:14:41,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:14:41,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:14:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:14:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:14:41,686 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-25 15:14:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:41,763 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-25 15:14:41,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:14:41,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:14:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:41,765 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:14:41,765 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:14:41,766 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-02-25 15:14:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:14:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-25 15:14:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:14:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-25 15:14:41,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-25 15:14:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:41,770 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-25 15:14:41,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:14:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-25 15:14:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:14:41,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:41,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:14:41,772 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-25 15:14:41,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:41,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:41,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:41,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:41,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:14:41,883 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-25 15:14:41,941 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:41,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:42,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:42,004 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:14:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:42,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:42,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:42,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:42,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:42,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:42,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:14:42,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:42,250 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:42,251 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,261 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,282 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:42,373 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:42,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:42,384 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,454 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,551 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,598 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:42,599 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:42,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:42,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:42,702 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,827 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:42,828 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:42,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:42,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:14:42,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:14:42,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:14:42,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:14:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:14:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:14:42,901 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-02-25 15:14:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:43,055 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-02-25 15:14:43,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:14:43,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:14:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:43,057 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:14:43,058 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:14:43,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:14:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:14:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-02-25 15:14:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:14:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-02-25 15:14:43,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-02-25 15:14:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:43,065 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-02-25 15:14:43,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:14:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-02-25 15:14:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:14:43,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:43,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:14:43,068 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-25 15:14:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:43,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:43,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:43,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:43,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:14:43,126 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-25 15:14:43,129 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:43,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:43,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:43,134 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:14:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:43,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:43,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:43,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:43,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:43,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:43,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:14:43,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:43,223 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:43,224 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,257 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,268 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,293 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:43,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:43,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:43,306 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,323 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,330 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,346 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:43,346 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:43,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:43,389 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:43,390 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:43,403 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:43,404 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:43,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:14:43,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:43,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:14:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:14:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:14:43,492 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-02-25 15:14:43,854 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-02-25 15:14:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:44,067 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-02-25 15:14:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:14:44,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:14:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:44,070 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:14:44,070 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:14:44,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:14:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:14:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-02-25 15:14:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:14:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-02-25 15:14:44,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-02-25 15:14:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:44,076 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-02-25 15:14:44,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:14:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-02-25 15:14:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:14:44,077 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:44,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:14:44,078 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-02-25 15:14:44,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:44,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:44,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:44,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:14:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:14:44,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:14:44,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:14:44,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:14:44,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:14:44,108 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-02-25 15:14:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:44,142 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-02-25 15:14:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:14:44,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:14:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:44,145 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:14:44,145 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:14:44,146 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-02-25 15:14:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:14:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-25 15:14:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:14:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-02-25 15:14:44,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-02-25 15:14:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:44,151 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-02-25 15:14:44,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:14:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-25 15:14:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:14:44,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:44,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:14:44,152 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-02-25 15:14:44,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:44,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:44,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:44,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:44,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:44,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:44,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:44,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:14:44,304 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-02-25 15:14:44,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:44,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:44,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:44,315 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:14:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:44,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:44,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:44,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:44,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:44,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:44,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:14:44,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:44,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:44,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:44,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:44,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:44,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:44,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:44,374 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,394 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,403 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,512 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:44,512 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,516 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,522 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,538 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:44,538 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:44,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:44,562 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:44,563 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,579 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:44,580 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:44,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:44,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:44,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:14:44,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:44,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:14:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:14:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:14:44,658 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-02-25 15:14:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:44,847 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-02-25 15:14:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:14:44,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:14:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:44,849 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:14:44,849 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:14:44,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:14:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:14:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-02-25 15:14:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:14:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-02-25 15:14:44,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-02-25 15:14:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:44,856 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-02-25 15:14:44,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:14:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-02-25 15:14:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:14:44,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:44,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:14:44,857 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-25 15:14:44,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:44,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:44,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:44,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:44,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:44,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:44,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:44,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:14:44,919 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-25 15:14:44,920 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:44,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:44,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:44,925 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:14:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:44,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:44,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:44,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:44,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:44,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:14:44,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:44,976 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:44,976 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:44,992 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,014 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:45,031 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:45,039 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:45,040 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,050 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,057 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,069 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:45,070 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:45,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,137 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:45,138 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,159 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:45,159 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:45,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:45,238 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,264 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:45,265 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-25 15:14:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:45,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:14:45,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:45,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:14:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:14:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:14:45,330 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-02-25 15:14:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:45,555 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-02-25 15:14:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:14:45,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:14:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:45,557 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:14:45,558 INFO L226 Difference]: Without dead ends: 34 [2019-02-25 15:14:45,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:14:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-25 15:14:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-02-25 15:14:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:14:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-02-25 15:14:45,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-02-25 15:14:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:45,565 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-02-25 15:14:45,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:14:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-02-25 15:14:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:14:45,566 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:45,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:14:45,566 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-02-25 15:14:45,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:45,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:45,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:45,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:45,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:14:45,606 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-02-25 15:14:45,608 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:45,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:45,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:45,613 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:14:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:45,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:45,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:45,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:45,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:45,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:14:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:45,635 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:45,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-25 15:14:45,667 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-25 15:14:45,668 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,675 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,682 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,690 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:45,690 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-02-25 15:14:45,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,699 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:14:45,700 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,705 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:45,705 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:14:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:14:45,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-25 15:14:45,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:14:45,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:14:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:14:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:14:45,741 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-02-25 15:14:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:45,782 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-02-25 15:14:45,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:14:45,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:14:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:45,785 INFO L225 Difference]: With dead ends: 30 [2019-02-25 15:14:45,785 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:14:45,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:14:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:14:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-02-25 15:14:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:14:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-02-25 15:14:45,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-02-25 15:14:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:45,794 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-02-25 15:14:45,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:14:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-02-25 15:14:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:14:45,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:45,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:14:45,796 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-25 15:14:45,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:45,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:45,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:45,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:45,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:14:45,919 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-25 15:14:45,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:45,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:45,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:45,926 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:14:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:45,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:45,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:45,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:45,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:45,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:14:45,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:45,954 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:45,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:45,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:45,985 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:45,985 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,003 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,016 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:46,049 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,055 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,059 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,070 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,070 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:46,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:46,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:46,099 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,113 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:46,114 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:46,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:46,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:46,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:46,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:46,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:14:46,155 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,168 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:46,169 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-25 15:14:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:46,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:46,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:14:46,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:46,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:14:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:14:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:14:46,296 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-02-25 15:14:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:46,669 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-02-25 15:14:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:14:46,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:14:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:46,671 INFO L225 Difference]: With dead ends: 48 [2019-02-25 15:14:46,671 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:14:46,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:14:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:14:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-02-25 15:14:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:14:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-25 15:14:46,682 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-25 15:14:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:46,682 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-25 15:14:46,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:14:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-25 15:14:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:14:46,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:46,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:14:46,683 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-02-25 15:14:46,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:46,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:46,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:46,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:46,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:46,750 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:14:46,750 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-02-25 15:14:46,752 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:46,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:46,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:46,759 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:14:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:46,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:46,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:46,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:46,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:46,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:46,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:14:46,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:46,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:14:46,785 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,792 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:46,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-25 15:14:46,819 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-25 15:14:46,820 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,834 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,839 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,850 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:46,850 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-25 15:14:46,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:46,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:14:46,887 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:46,893 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:46,893 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-25 15:14:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:46,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:47,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:47,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:14:47,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:47,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:14:47,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:14:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:14:47,064 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-02-25 15:14:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:47,352 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-02-25 15:14:47,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:14:47,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:14:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:47,353 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:14:47,353 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:14:47,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:14:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:14:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-02-25 15:14:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:14:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-02-25 15:14:47,363 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-02-25 15:14:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-02-25 15:14:47,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:14:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-02-25 15:14:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:14:47,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:47,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:14:47,364 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-02-25 15:14:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:47,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:47,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:47,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:47,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:47,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:47,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:14:47,449 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-02-25 15:14:47,450 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:47,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:47,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:47,455 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:14:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:47,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:47,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:47,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:47,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:47,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:47,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:14:47,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:47,503 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:47,507 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-25 15:14:47,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:47,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:47,515 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-25 15:14:47,515 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,522 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,528 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:14:47,546 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,550 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,560 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:47,561 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-25 15:14:47,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:47,675 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:14:47,676 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,687 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:47,687 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-25 15:14:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:47,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:47,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:14:47,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-02-25 15:14:47,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:14:47,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:14:47,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:14:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:14:47,724 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-02-25 15:14:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:47,841 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-02-25 15:14:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:14:47,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:14:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:47,843 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:14:47,844 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:14:47,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:14:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:14:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-02-25 15:14:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:14:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-02-25 15:14:47,855 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-02-25 15:14:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-02-25 15:14:47,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:14:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-02-25 15:14:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:14:47,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:47,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:14:47,857 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-02-25 15:14:47,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:47,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:47,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:14:47,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:47,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:47,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:14:47,908 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-02-25 15:14:47,909 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:47,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:47,917 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:47,917 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:14:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:47,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:47,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:47,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:47,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:47,932 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:14:47,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:47,937 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:47,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:47,944 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:47,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:47,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:47,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:47,963 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:47,978 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,003 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,108 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:48,108 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,117 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,125 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,135 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,135 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:48,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,218 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:48,219 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,228 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:48,229 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:48,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,254 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:14:48,255 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:48,255 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,266 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:48,266 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-25 15:14:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:48,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:14:48,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:48,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:14:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:14:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:14:48,348 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-02-25 15:14:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:48,493 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-02-25 15:14:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:14:48,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-25 15:14:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:48,494 INFO L225 Difference]: With dead ends: 38 [2019-02-25 15:14:48,494 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:14:48,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:14:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:14:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-02-25 15:14:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:14:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-02-25 15:14:48,503 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-02-25 15:14:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:48,503 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-02-25 15:14:48,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:14:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-02-25 15:14:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:14:48,504 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:48,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:14:48,504 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-02-25 15:14:48,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:48,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:48,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:48,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:48,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:48,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:48,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:14:48,570 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-02-25 15:14:48,573 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:48,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:48,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:48,579 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:14:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:48,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:48,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:48,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:48,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:48,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:48,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:14:48,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:48,599 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:14:48,599 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,606 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:48,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:48,628 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-25 15:14:48,629 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,640 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,646 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,654 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:48,654 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-02-25 15:14:48,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,673 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:14:48,674 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,686 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,687 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:14:48,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:48,703 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-02-25 15:14:48,704 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:48,710 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:48,710 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-25 15:14:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:48,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:14:48,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:48,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:14:48,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:14:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:14:48,760 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-02-25 15:14:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:49,136 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-02-25 15:14:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:14:49,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:14:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:49,138 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:14:49,138 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:14:49,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:14:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:14:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-25 15:14:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:14:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-02-25 15:14:49,149 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-02-25 15:14:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:49,149 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-02-25 15:14:49,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:14:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-02-25 15:14:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:14:49,150 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:49,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:14:49,151 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-02-25 15:14:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:49,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:49,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:49,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:14:49,206 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-02-25 15:14:49,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:49,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:49,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:49,211 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:14:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:49,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:49,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:49,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:49,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:49,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:49,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:14:49,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:49,235 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:49,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-25 15:14:49,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:49,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:49,265 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-25 15:14:49,265 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,274 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,280 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,298 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:14:49,299 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,305 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,315 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:49,316 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-25 15:14:49,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:49,335 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:14:49,335 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,340 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,340 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:14:49,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:49,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:49,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:49,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-02-25 15:14:49,380 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,385 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:49,385 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-25 15:14:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:49,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:49,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:49,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:14:49,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:49,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:14:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:14:49,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:14:49,526 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-02-25 15:14:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:49,761 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-02-25 15:14:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:14:49,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:14:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:49,763 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:14:49,763 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:14:49,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:14:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:14:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-02-25 15:14:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:14:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-02-25 15:14:49,777 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-02-25 15:14:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:49,777 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-02-25 15:14:49,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:14:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-02-25 15:14:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:14:49,778 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:49,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:14:49,779 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-02-25 15:14:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:49,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:49,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:49,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:14:49,891 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-25 15:14:49,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:49,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:49,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:49,896 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:14:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:49,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:49,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:49,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:49,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:49,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:49,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:14:49,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:49,963 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:49,963 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,974 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,985 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:49,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:49,996 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:50,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:50,001 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,009 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,015 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,025 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,026 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:50,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:50,048 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,064 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:50,064 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:50,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,082 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:14:50,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:50,084 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,095 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:50,096 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-02-25 15:14:50,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:50,131 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,145 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:50,145 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-25 15:14:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:50,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:50,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:50,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:14:50,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:50,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:14:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:14:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:14:50,225 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-02-25 15:14:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:50,432 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-02-25 15:14:50,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:14:50,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:14:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:50,433 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:14:50,434 INFO L226 Difference]: Without dead ends: 48 [2019-02-25 15:14:50,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:14:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-25 15:14:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-02-25 15:14:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:14:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-25 15:14:50,443 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-02-25 15:14:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:50,443 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-25 15:14:50,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:14:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-25 15:14:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:14:50,444 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:50,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:14:50,444 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-02-25 15:14:50,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:50,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:50,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:50,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:50,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:50,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:50,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:14:50,640 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-02-25 15:14:50,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:50,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:50,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:50,644 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:14:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:50,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:50,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:50,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:50,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:50,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:14:50,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:50,669 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:50,678 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-25 15:14:50,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,692 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-25 15:14:50,693 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,707 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,712 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,734 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:14:50,734 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,741 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,753 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,753 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-02-25 15:14:50,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:50,797 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:14:50,824 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:14:50,824 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-25 15:14:50,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-02-25 15:14:50,853 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:50,879 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:14:50,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:14:50,881 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:50,894 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:14:50,894 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-25 15:14:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:50,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:50,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-25 15:14:51,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:51,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:14:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:14:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:14:51,001 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-02-25 15:14:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:51,303 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-02-25 15:14:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:14:51,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:14:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:51,304 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:14:51,304 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:14:51,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:14:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:14:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-02-25 15:14:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:14:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-02-25 15:14:51,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-02-25 15:14:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:51,315 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-02-25 15:14:51,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:14:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-02-25 15:14:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:14:51,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:51,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:14:51,316 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-02-25 15:14:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:51,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:51,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:14:51,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:51,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:51,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:14:51,456 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-02-25 15:14:51,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:14:51,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:14:51,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:14:51,461 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:14:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:51,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:14:51,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:51,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:51,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:51,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:51,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:14:51,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:51,493 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:14:51,494 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,502 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,515 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:14:51,530 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-25 15:14:51,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-25 15:14:51,540 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,559 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,567 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,584 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,585 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-25 15:14:51,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:51,623 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,701 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:51,701 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:14:51,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:14:51,729 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,738 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:51,738 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-02-25 15:14:51,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:14:51,765 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:14:51,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:14:51,766 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,778 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:14:51,778 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-25 15:14:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:51,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:51,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:51,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:14:51,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:51,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:14:51,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:14:51,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:14:51,857 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-02-25 15:14:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:52,329 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-02-25 15:14:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:14:52,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:14:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:52,330 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:14:52,330 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:14:52,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:14:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:14:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:14:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:14:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:14:52,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-25 15:14:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:52,332 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:14:52,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:14:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:14:52,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:14:52,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:14:52,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:14:52,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:14:52,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:14:52,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:14:52,477 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-02-25 15:14:53,101 WARN L181 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-02-25 15:14:53,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-25 15:14:53,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-25 15:14:53,104 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-02-25 15:14:53,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-02-25 15:14:53,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-02-25 15:14:53,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-02-25 15:14:53,105 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-02-25 15:14:53,105 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-02-25 15:14:53,105 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-02-25 15:14:53,114 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:14:53 BoogieIcfgContainer [2019-02-25 15:14:53,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:14:53,115 INFO L168 Benchmark]: Toolchain (without parser) took 12410.37 ms. Allocated memory was 138.4 MB in the beginning and 322.4 MB in the end (delta: 184.0 MB). Free memory was 105.7 MB in the beginning and 197.4 MB in the end (delta: -91.7 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:14:53,115 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:14:53,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.23 ms. Allocated memory is still 138.4 MB. Free memory was 105.7 MB in the beginning and 103.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:14:53,116 INFO L168 Benchmark]: Boogie Preprocessor took 21.68 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:14:53,116 INFO L168 Benchmark]: RCFGBuilder took 320.23 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 92.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-02-25 15:14:53,117 INFO L168 Benchmark]: TraceAbstraction took 12012.09 ms. Allocated memory was 138.4 MB in the beginning and 322.4 MB in the end (delta: 184.0 MB). Free memory was 92.1 MB in the beginning and 197.4 MB in the end (delta: -105.3 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2019-02-25 15:14:53,119 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.17 ms. Allocated memory is still 138.4 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.23 ms. Allocated memory is still 138.4 MB. Free memory was 105.7 MB in the beginning and 103.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.68 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 320.23 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 92.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12012.09 ms. Allocated memory was 138.4 MB in the beginning and 322.4 MB in the end (delta: 184.0 MB). Free memory was 92.1 MB in the beginning and 197.4 MB in the end (delta: -105.3 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: 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: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 11.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...