java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:52:39,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:52:39,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:52:39,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:52:39,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:52:39,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:52:39,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:52:39,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:52:39,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:52:39,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:52:39,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:52:39,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:52:39,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:52:39,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:52:39,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:52:39,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:52:39,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:52:39,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:52:39,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:52:39,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:52:39,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:52:39,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:52:39,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:52:39,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:52:39,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:52:39,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:52:39,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:52:39,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:52:39,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:52:39,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:52:39,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:52:39,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:52:39,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:52:39,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:52:39,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:52:39,688 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:52:39,689 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 09:52:39,702 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:52:39,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:52:39,704 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:52:39,704 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:52:39,705 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:52:39,705 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:52:39,705 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:52:39,705 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:52:39,705 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:52:39,705 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:52:39,708 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:52:39,708 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:52:39,708 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:52:39,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:52:39,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:52:39,709 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:52:39,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:52:39,710 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:52:39,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:52:39,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:52:39,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:52:39,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:52:39,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:52:39,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:52:39,711 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:52:39,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:52:39,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:52:39,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:52:39,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:52:39,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:52:39,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:52:39,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:52:39,712 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:52:39,712 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:52:39,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:52:39,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:52:39,713 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:52:39,713 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:52:39,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:52:39,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:52:39,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:52:39,765 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:52:39,766 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:52:39,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-02-18 09:52:39,767 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-02-18 09:52:39,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:52:39,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:52:39,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:52:39,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:52:39,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:52:39,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:52:39,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:52:39,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:52:39,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:52:39,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:52:39,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:52:40,206 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:52:40,206 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-18 09:52:40,208 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40 BoogieIcfgContainer [2019-02-18 09:52:40,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:52:40,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:52:40,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:52:40,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:52:40,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/2) ... [2019-02-18 09:52:40,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0cba73 and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:52:40, skipping insertion in model container [2019-02-18 09:52:40,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40" (2/2) ... [2019-02-18 09:52:40,216 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-02-18 09:52:40,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:52:40,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:52:40,251 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:52:40,284 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:52:40,284 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:52:40,284 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:52:40,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:52:40,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:52:40,285 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:52:40,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:52:40,285 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:52:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-18 09:52:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:52:40,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:52:40,312 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-18 09:52:40,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,467 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-18 09:52:40,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:52:40,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:52:40,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:52:40,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:52:40,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:52:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:52:40,489 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-18 09:52:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:40,574 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-18 09:52:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:52:40,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:52:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:40,599 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:52:40,599 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:52:40,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:52:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:52:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-18 09:52:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 09:52:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-18 09:52:40,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-18 09:52:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:40,643 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-18 09:52:40,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:52:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-18 09:52:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:52:40,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:52:40,644 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-18 09:52:40,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:52:40,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:40,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:40,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:52:40,791 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-18 09:52:40,860 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:52:40,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:52:45,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:52:45,575 INFO L272 AbstractInterpreter]: Visited 6 different actions 50 times. Merged at 4 different actions 28 times. Widened at 2 different actions 12 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:52:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:45,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:52:45,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,588 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-18 09:52:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:45,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:52:45,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:52:46,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-18 09:52:46,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:52:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:52:46,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:52:46,035 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-18 09:52:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:46,138 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-18 09:52:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:52:46,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-18 09:52:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:46,139 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:52:46,140 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:52:46,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:52:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:52:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-18 09:52:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:52:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-18 09:52:46,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-18 09:52:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:46,145 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-18 09:52:46,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:52:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-18 09:52:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:52:46,146 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:46,146 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-18 09:52:46,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-18 09:52:46,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:52:46,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:46,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:46,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:46,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,244 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-18 09:52:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:46,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:46,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:52:46,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:46,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:52:46,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:52:46,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-18 09:52:46,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:52:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:52:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:52:46,510 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-18 09:52:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:46,660 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-18 09:52:46,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:52:46,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 09:52:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:46,663 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:52:46,663 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:52:46,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:52:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:52:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 09:52:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:52:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-18 09:52:46,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-18 09:52:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:46,667 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-18 09:52:46,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:52:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-18 09:52:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:52:46,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:46,668 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-18 09:52:46,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-18 09:52:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:52:46,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:46,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:46,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:46,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,824 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-18 09:52:46,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:46,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:46,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:46,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:46,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:52:46,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:52:47,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:47,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-18 09:52:47,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:52:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:52:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:52:47,131 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-18 09:52:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:47,214 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-18 09:52:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:52:47,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-18 09:52:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:47,215 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:52:47,215 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:52:47,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:52:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:52:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-18 09:52:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:52:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-18 09:52:47,219 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-18 09:52:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:47,219 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-18 09:52:47,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:52:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-18 09:52:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:52:47,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:47,220 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-18 09:52:47,221 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-18 09:52:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:52:47,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:47,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:47,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:47,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,373 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-18 09:52:47,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:47,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:52:47,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:52:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:47,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-18 09:52:47,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:47,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:52:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:52:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:52:47,835 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-18 09:52:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:47,887 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-18 09:52:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:52:47,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-18 09:52:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:47,888 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:52:47,888 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:52:47,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:52:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:52:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 09:52:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:52:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-18 09:52:47,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-18 09:52:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:47,892 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-18 09:52:47,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:52:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-18 09:52:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-18 09:52:47,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:47,893 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-18 09:52:47,894 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-18 09:52:47,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:52:48,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:48,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:48,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:48,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,053 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-18 09:52:48,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:48,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:48,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:52:48,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:48,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:52:48,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:52:48,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:48,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-18 09:52:48,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:48,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:52:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:52:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:52:48,544 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-18 09:52:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:48,675 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-18 09:52:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:52:48,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-18 09:52:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:48,676 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:52:48,677 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:52:48,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:52:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:52:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:52:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:52:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-18 09:52:48,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-18 09:52:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:48,683 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-18 09:52:48,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:52:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-18 09:52:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:52:48,684 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:48,684 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-18 09:52:48,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:48,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-18 09:52:48,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:48,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:48,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:52:48,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:48,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:48,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:48,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,801 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-18 09:52:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:48,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:48,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:48,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:48,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:52:48,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:52:49,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:49,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-18 09:52:49,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:49,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:52:49,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:52:49,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:49,091 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-18 09:52:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,138 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-18 09:52:49,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:52:49,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-18 09:52:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,139 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:52:49,139 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:52:49,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:52:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-18 09:52:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:52:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-18 09:52:49,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-18 09:52:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,144 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-18 09:52:49,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:52:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-18 09:52:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-18 09:52:49,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,144 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-18 09:52:49,145 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-18 09:52:49,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:49,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:52:49,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:49,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:49,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:49,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,297 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-18 09:52:49,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:49,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:49,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:52:49,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:52:49,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:49,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-18 09:52:49,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:52:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:52:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:52:49,517 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-18 09:52:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,574 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-18 09:52:49,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:52:49,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-18 09:52:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,578 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:52:49,578 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:52:49,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:52:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:52:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-18 09:52:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:52:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-18 09:52:49,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-18 09:52:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,583 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-18 09:52:49,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:52:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-18 09:52:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:52:49,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,584 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-18 09:52:49,584 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-18 09:52:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:52:49,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:49,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:49,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:49,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,737 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-18 09:52:49,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:49,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:49,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-18 09:52:49,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:49,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:52:49,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:52:50,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:50,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-18 09:52:50,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:50,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:52:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:52:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:52:50,032 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-18 09:52:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:50,175 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-18 09:52:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:52:50,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-18 09:52:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:50,176 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:52:50,177 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:52:50,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:52:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:52:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-18 09:52:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:52:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-18 09:52:50,181 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-18 09:52:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:50,181 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-18 09:52:50,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:52:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-18 09:52:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-18 09:52:50,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:50,182 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-18 09:52:50,183 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-18 09:52:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:50,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:52:50,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:50,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:50,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:50,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,311 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-18 09:52:50,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:50,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:50,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:50,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:50,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:52:50,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:52:50,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-18 09:52:50,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:50,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:52:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:52:50,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:50,631 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-18 09:52:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:50,684 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-18 09:52:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:52:50,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-18 09:52:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:50,685 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:52:50,685 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:52:50,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:52:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-18 09:52:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:52:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-18 09:52:50,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-18 09:52:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:50,690 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-18 09:52:50,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:52:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-18 09:52:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:52:50,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:50,692 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-18 09:52:50,692 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-18 09:52:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:52:50,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:50,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:50,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:50,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,856 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-18 09:52:50,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:50,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:52:50,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:52:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:51,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-18 09:52:51,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:51,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:52:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:52:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:52:51,268 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-18 09:52:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:51,328 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-18 09:52:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:52:51,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-18 09:52:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:51,331 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:52:51,331 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:52:51,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:52:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:52:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-18 09:52:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 09:52:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-18 09:52:51,336 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-18 09:52:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:51,336 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-18 09:52:51,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:52:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-18 09:52:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-18 09:52:51,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:51,337 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-18 09:52:51,337 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-18 09:52:51,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:51,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:52:51,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:51,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:51,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:51,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,526 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-18 09:52:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:51,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:51,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-18 09:52:51,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:51,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:51,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:52:51,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:51,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:51,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-18 09:52:52,220 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-02-18 09:52:52,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-02-18 09:52:52,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 09:52:52,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:52,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-02-18 09:52:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:52:52,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:52:52,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:52,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-02-18 09:52:52,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:52:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:52:52,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:52:52,951 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-02-18 09:52:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:58,606 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-18 09:52:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:52:58,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-02-18 09:52:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:58,608 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:52:58,608 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:52:58,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-02-18 09:52:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:52:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-18 09:52:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:52:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-18 09:52:58,614 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-18 09:52:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:58,615 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-18 09:52:58,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:52:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-18 09:52:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:52:58,616 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:58,616 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-18 09:52:58,616 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:58,617 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-18 09:52:58,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:58,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:58,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:52:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:58,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:58,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:58,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:58,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:58,808 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-18 09:52:58,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:58,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:58,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:58,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:58,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:52:58,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:52:59,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:59,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-18 09:52:59,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:59,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:52:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:52:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:59,255 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-18 09:52:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:59,344 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-18 09:52:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:52:59,344 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-18 09:52:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:59,345 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:52:59,346 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:52:59,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:59,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:52:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-18 09:52:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:52:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-18 09:52:59,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-18 09:52:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:59,353 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-18 09:52:59,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:52:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-18 09:52:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:52:59,354 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:59,354 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-18 09:52:59,354 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-18 09:52:59,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:59,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:52:59,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:59,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:59,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:59,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,543 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-18 09:52:59,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:59,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:52:59,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:52:59,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:59,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-18 09:52:59,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:59,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:52:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:52:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:52:59,841 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-18 09:52:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:59,926 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-18 09:52:59,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:52:59,927 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-18 09:52:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:59,928 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:52:59,928 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:52:59,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:52:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:52:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-18 09:52:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:52:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-18 09:52:59,935 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-18 09:52:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:59,936 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-18 09:52:59,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:52:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-18 09:52:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:52:59,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:59,937 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-18 09:52:59,937 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-18 09:52:59,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:59,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:59,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:53:00,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:00,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:00,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:00,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:00,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:00,182 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-18 09:53:00,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:00,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:00,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:53:00,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:00,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:53:00,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:53:00,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-02-18 09:53:00,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:00,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:53:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:53:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:53:00,685 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-18 09:53:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:00,814 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-18 09:53:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:53:00,815 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-18 09:53:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:00,815 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:53:00,815 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:53:00,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:53:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:53:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-18 09:53:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:53:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-18 09:53:00,821 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-18 09:53:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:00,822 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-18 09:53:00,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:53:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-18 09:53:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:53:00,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:00,823 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-18 09:53:00,823 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-18 09:53:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:00,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:00,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:53:01,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:01,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:01,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:01,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:01,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:01,081 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:01,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:01,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:01,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:01,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:01,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:53:01,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:53:02,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:02,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-18 09:53:02,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:02,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:53:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:53:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:53:02,079 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-18 09:53:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:02,202 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-18 09:53:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:53:02,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-18 09:53:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:02,203 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:53:02,203 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:53:02,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:53:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:53:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-18 09:53:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:53:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-18 09:53:02,210 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-18 09:53:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:02,210 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-18 09:53:02,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:53:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-18 09:53:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:53:02,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:02,211 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-18 09:53:02,212 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-18 09:53:02,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:02,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:02,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:02,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:02,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:53:02,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:02,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:02,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:02,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,413 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:02,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:02,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:53:02,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:53:03,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:03,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-18 09:53:03,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:03,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:53:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:53:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:53:03,287 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-18 09:53:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:03,351 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-18 09:53:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:53:03,352 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-18 09:53:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:03,353 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:53:03,353 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:53:03,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:53:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:53:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-18 09:53:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:53:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-18 09:53:03,359 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-18 09:53:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:03,360 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-18 09:53:03,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:53:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-18 09:53:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-18 09:53:03,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:03,361 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-18 09:53:03,361 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-18 09:53:03,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:03,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:03,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:03,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:53:04,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:04,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:04,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:04,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:04,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:04,123 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:04,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:04,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-18 09:53:04,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:04,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:53:04,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:53:04,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:04,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-18 09:53:04,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:04,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:53:04,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:53:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:53:04,709 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-18 09:53:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:04,789 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-18 09:53:04,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:53:04,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-18 09:53:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:04,790 INFO L225 Difference]: With dead ends: 61 [2019-02-18 09:53:04,790 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:53:04,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:53:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:53:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-18 09:53:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:53:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-18 09:53:04,796 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-18 09:53:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:04,796 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-18 09:53:04,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:53:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-18 09:53:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:53:04,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:04,797 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-18 09:53:04,797 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-18 09:53:04,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:04,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:04,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:04,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:04,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:53:05,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:05,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:05,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:05,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:05,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:05,139 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:05,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:05,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:05,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:05,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:05,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:53:05,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:53:05,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:05,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-18 09:53:05,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:05,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:53:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:53:05,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:53:05,705 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-18 09:53:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:05,875 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-18 09:53:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:53:05,875 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-18 09:53:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:05,876 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:53:05,876 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:53:05,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:53:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:53:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-18 09:53:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-18 09:53:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-18 09:53:05,882 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-18 09:53:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:05,882 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-18 09:53:05,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:53:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-18 09:53:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-18 09:53:05,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:05,883 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-18 09:53:05,884 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-18 09:53:05,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:05,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:05,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:53:06,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:06,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:06,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:06,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,741 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:06,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:06,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:53:06,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:53:07,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:07,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-18 09:53:07,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:07,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:53:07,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:53:07,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:53:07,680 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-18 09:53:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:07,755 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-18 09:53:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:53:07,755 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-18 09:53:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:07,756 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:53:07,757 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:53:07,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:53:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:53:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-18 09:53:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:53:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-18 09:53:07,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-18 09:53:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:07,764 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-18 09:53:07,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:53:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-18 09:53:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:53:07,764 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:07,765 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-18 09:53:07,765 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-18 09:53:07,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:07,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:53:08,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:08,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:08,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:08,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:08,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:08,016 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:08,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:08,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:08,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:53:08,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:08,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:53:08,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:53:08,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:08,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-18 09:53:08,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:08,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:53:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:53:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:53:08,649 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-18 09:53:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:08,761 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-18 09:53:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:53:08,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-18 09:53:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:08,762 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:53:08,763 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:53:08,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:53:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:53:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-18 09:53:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:53:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-18 09:53:08,769 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-18 09:53:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:08,769 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-18 09:53:08,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:53:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-18 09:53:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-18 09:53:08,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:08,770 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-18 09:53:08,771 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-18 09:53:08,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:08,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:08,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:53:09,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:09,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:09,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:09,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:09,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:09,082 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:09,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:09,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:09,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:09,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:09,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:53:09,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:53:09,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-18 09:53:09,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:09,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:53:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:53:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:53:09,831 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-18 09:53:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:09,924 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-18 09:53:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:53:09,927 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-18 09:53:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:09,928 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:53:09,928 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:53:09,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:53:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:53:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-18 09:53:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:53:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-18 09:53:09,934 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-18 09:53:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-18 09:53:09,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:53:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-18 09:53:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:53:09,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:09,936 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-18 09:53:09,936 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-18 09:53:09,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:09,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:09,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:09,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:09,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:53:10,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:10,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:10,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:10,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:10,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:10,243 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:10,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:10,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:10,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:53:10,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:53:10,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:10,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-18 09:53:10,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:10,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:53:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:53:10,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:53:10,904 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-18 09:53:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:10,990 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-18 09:53:10,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:53:10,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-18 09:53:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:10,991 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:53:10,991 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:53:10,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:53:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:53:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-18 09:53:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:53:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-18 09:53:10,998 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-18 09:53:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:10,998 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-18 09:53:10,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:53:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-18 09:53:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-18 09:53:10,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:10,999 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-18 09:53:10,999 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-18 09:53:11,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:11,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:11,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:53:11,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:11,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:11,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:11,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:11,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:11,394 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:11,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:11,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:11,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:53:11,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:11,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:53:11,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:53:12,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:12,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-02-18 09:53:12,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:12,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:53:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:53:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:12,593 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-18 09:53:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:12,676 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-18 09:53:12,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:53:12,676 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-18 09:53:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:12,677 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:53:12,677 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:53:12,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:53:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-18 09:53:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:53:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-18 09:53:12,682 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-18 09:53:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:12,682 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-18 09:53:12,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:53:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-18 09:53:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:53:12,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:12,683 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-18 09:53:12,683 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-18 09:53:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:12,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:12,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:53:13,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:13,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:13,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:13,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:13,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:13,124 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:13,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:13,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:13,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:13,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:13,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:53:13,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:53:13,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:13,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-18 09:53:13,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:13,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:53:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:53:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:13,915 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-18 09:53:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:14,023 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-18 09:53:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:53:14,024 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-18 09:53:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:14,025 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:53:14,025 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:53:14,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:53:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-18 09:53:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:53:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-18 09:53:14,031 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-18 09:53:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:14,031 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-18 09:53:14,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:53:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-18 09:53:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-18 09:53:14,032 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:14,032 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-18 09:53:14,033 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-18 09:53:14,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:14,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:14,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:14,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:14,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:53:14,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:14,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:14,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:14,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:14,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:14,850 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:14,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:14,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:14,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:53:14,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:53:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-18 09:53:15,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:15,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:53:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:53:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:53:15,840 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-18 09:53:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:15,933 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-18 09:53:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:53:15,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-18 09:53:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:15,934 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:53:15,935 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:53:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:53:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:53:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-18 09:53:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:53:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-18 09:53:15,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-18 09:53:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:15,940 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-18 09:53:15,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:53:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-18 09:53:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:53:15,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:15,941 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-18 09:53:15,941 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-18 09:53:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:15,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:15,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:53:16,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:16,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:16,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:16,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:16,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:16,863 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:16,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:16,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:17,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-18 09:53:17,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:17,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:53:17,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:53:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-02-18 09:53:18,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:53:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:53:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:53:18,585 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-18 09:53:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:18,662 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-18 09:53:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:53:18,663 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-18 09:53:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:18,663 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:53:18,663 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:53:18,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:53:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:53:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-18 09:53:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:53:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-18 09:53:18,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-18 09:53:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:18,668 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-18 09:53:18,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:53:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-18 09:53:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:53:18,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:18,669 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-18 09:53:18,669 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-18 09:53:18,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:18,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:18,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:53:19,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:19,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:19,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:19,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:19,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:19,067 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:19,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:19,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:19,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:19,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:53:19,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:53:20,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:20,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-18 09:53:20,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:20,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:53:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:53:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:20,017 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-18 09:53:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:20,148 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-18 09:53:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:53:20,148 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-18 09:53:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:20,149 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:53:20,149 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:53:20,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:53:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-18 09:53:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:53:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-18 09:53:20,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-18 09:53:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:20,154 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-18 09:53:20,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:53:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-18 09:53:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:53:20,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:20,155 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-18 09:53:20,155 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-18 09:53:20,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:53:20,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:20,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:20,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:20,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:20,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:20,921 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:20,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:20,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:53:20,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:53:22,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:22,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-18 09:53:22,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:22,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:53:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:53:22,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:22,121 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-18 09:53:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:22,252 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-18 09:53:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:53:22,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-18 09:53:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:22,253 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:53:22,254 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:53:22,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:53:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-18 09:53:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:53:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-18 09:53:22,258 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-18 09:53:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:22,259 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-18 09:53:22,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:53:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-18 09:53:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:53:22,259 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:22,259 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-18 09:53:22,260 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-18 09:53:22,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:53:23,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:23,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:23,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:23,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,058 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:23,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:23,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:23,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:53:23,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:23,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:53:23,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:53:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-02-18 09:53:24,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:24,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:53:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:53:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:53:24,376 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-18 09:53:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:24,451 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-18 09:53:24,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:53:24,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-18 09:53:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:24,452 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:53:24,452 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:53:24,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:53:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:53:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-18 09:53:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:53:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-18 09:53:24,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-18 09:53:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:24,457 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-18 09:53:24,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:53:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-18 09:53:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:53:24,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:24,458 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-18 09:53:24,458 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-18 09:53:24,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:53:24,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:24,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:24,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:24,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:24,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:24,944 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:24,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:24,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:24,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:24,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:24,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:53:25,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:53:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:26,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-18 09:53:26,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:26,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:53:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:53:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:26,170 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-18 09:53:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:26,285 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-18 09:53:26,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:53:26,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-18 09:53:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:26,286 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:53:26,286 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:53:26,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:53:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-18 09:53:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-18 09:53:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-18 09:53:26,290 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-18 09:53:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:26,290 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-18 09:53:26,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:53:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-18 09:53:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-18 09:53:26,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:26,290 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-18 09:53:26,291 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-18 09:53:26,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:26,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:26,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:26,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:26,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:53:27,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:27,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:27,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:27,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:27,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:27,984 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:28,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:28,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:28,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:53:28,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:53:29,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:29,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-18 09:53:29,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:53:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:53:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:53:29,215 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-18 09:53:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:29,359 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-18 09:53:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:53:29,360 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-18 09:53:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:29,361 INFO L225 Difference]: With dead ends: 103 [2019-02-18 09:53:29,361 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:53:29,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:53:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:53:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-18 09:53:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:53:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-18 09:53:29,365 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-18 09:53:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:29,365 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-18 09:53:29,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:53:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-18 09:53:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:53:29,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:29,366 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-18 09:53:29,367 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-18 09:53:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:53:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:29,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:29,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:29,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:29,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:29,968 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:29,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:29,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:30,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-18 09:53:30,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:30,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:53:30,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:53:31,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:31,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-18 09:53:31,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:31,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:53:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:53:31,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:53:31,453 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-18 09:53:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:31,600 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-18 09:53:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:53:31,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-18 09:53:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:31,601 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:53:31,601 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:53:31,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:53:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:53:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-18 09:53:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:53:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-18 09:53:31,606 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-18 09:53:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:31,606 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-18 09:53:31,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:53:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-18 09:53:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-18 09:53:31,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:31,607 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-18 09:53:31,607 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-18 09:53:31,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:31,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:31,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:31,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:31,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:53:32,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:32,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:32,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:32,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:32,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:32,172 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:32,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:32,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:32,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:32,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:32,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:53:32,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:53:34,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:34,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-18 09:53:34,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:34,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:53:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:53:34,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:34,096 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-18 09:53:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:34,260 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-18 09:53:34,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:53:34,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-18 09:53:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:34,261 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:53:34,261 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:53:34,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:53:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-18 09:53:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:53:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-18 09:53:34,265 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-18 09:53:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:34,265 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-18 09:53:34,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:53:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-18 09:53:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:53:34,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:34,266 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-18 09:53:34,266 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-18 09:53:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:34,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:34,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:53:34,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:34,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:34,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:34,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:34,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:34,818 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:34,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:34,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:53:34,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:53:36,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:36,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-18 09:53:36,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:36,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:53:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:53:36,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:53:36,291 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-18 09:53:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:36,482 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-18 09:53:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:53:36,483 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-18 09:53:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:36,484 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:53:36,484 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:53:36,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:53:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:53:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-18 09:53:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:53:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-18 09:53:36,489 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-18 09:53:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-18 09:53:36,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:53:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-18 09:53:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-18 09:53:36,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:36,490 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-18 09:53:36,490 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:36,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-18 09:53:36,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:36,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:53:37,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:37,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:37,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:37,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:37,345 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:37,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:37,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-18 09:53:37,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:37,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:53:37,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:53:39,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-18 09:53:39,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:39,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:53:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:53:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:53:39,510 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-18 09:53:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:39,658 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-18 09:53:39,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:53:39,658 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-18 09:53:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:39,659 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:53:39,659 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:53:39,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:53:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:53:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-18 09:53:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:53:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-18 09:53:39,663 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-18 09:53:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:39,663 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-18 09:53:39,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:53:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-18 09:53:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:53:39,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:39,664 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-18 09:53:39,664 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-18 09:53:39,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:39,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:39,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:53:40,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:40,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:40,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:40,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:40,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:40,721 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:40,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:40,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:40,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:40,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:40,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:53:40,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:53:42,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:42,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-18 09:53:42,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:42,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:53:42,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:53:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:42,469 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-18 09:53:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:42,621 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-18 09:53:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:53:42,622 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-18 09:53:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:42,622 INFO L225 Difference]: With dead ends: 118 [2019-02-18 09:53:42,623 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:53:42,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:53:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-18 09:53:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-18 09:53:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-18 09:53:42,627 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-18 09:53:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:42,627 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-18 09:53:42,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:53:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-18 09:53:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-18 09:53:42,628 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:42,628 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-18 09:53:42,628 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-18 09:53:42,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:42,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:42,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:53:43,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:43,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:43,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:43,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:43,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:43,564 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:43,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:43,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:43,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:53:43,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:53:45,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:45,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-18 09:53:45,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:45,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:53:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:53:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:53:45,209 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-18 09:53:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:45,349 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-18 09:53:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:53:45,350 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-18 09:53:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:45,351 INFO L225 Difference]: With dead ends: 121 [2019-02-18 09:53:45,351 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:53:45,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:53:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:53:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-18 09:53:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:53:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-18 09:53:45,355 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-18 09:53:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:45,356 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-18 09:53:45,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:53:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-18 09:53:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:53:45,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:45,356 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-18 09:53:45,356 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-18 09:53:45,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:45,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:45,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:45,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:53:46,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:46,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:46,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:46,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:46,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:46,204 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:46,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:46,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:46,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:53:46,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:46,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:53:46,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:53:48,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:48,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-18 09:53:48,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:48,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:53:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:53:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:53:48,714 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-18 09:53:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:48,897 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-18 09:53:48,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:53:48,897 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-18 09:53:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:48,898 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:53:48,898 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:53:48,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:53:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:53:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-18 09:53:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-18 09:53:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-18 09:53:48,902 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-18 09:53:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:48,902 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-18 09:53:48,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:53:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-18 09:53:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-18 09:53:48,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:48,903 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-18 09:53:48,903 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-18 09:53:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:48,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:48,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:53:49,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:49,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:49,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:49,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:49,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:49,751 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:49,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:49,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:49,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:49,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:53:49,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:53:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-18 09:53:51,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:51,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:53:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:53:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:51,690 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-18 09:53:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:51,854 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-18 09:53:51,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:53:51,854 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-18 09:53:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:51,855 INFO L225 Difference]: With dead ends: 127 [2019-02-18 09:53:51,855 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:53:51,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:53:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-18 09:53:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:53:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-18 09:53:51,859 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-18 09:53:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:51,860 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-18 09:53:51,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:53:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-18 09:53:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:53:51,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:51,861 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-18 09:53:51,861 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-18 09:53:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:51,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:51,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:51,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:51,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:53:52,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:52,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:52,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:52,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:52,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:52,672 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:52,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:52,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:53:52,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:53:54,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:54,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-18 09:53:54,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:54,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:53:54,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:53:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:53:54,880 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-18 09:53:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:55,031 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-18 09:53:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:53:55,032 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-18 09:53:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:55,032 INFO L225 Difference]: With dead ends: 130 [2019-02-18 09:53:55,033 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:53:55,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:53:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:53:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-18 09:53:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:53:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-18 09:53:55,038 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-18 09:53:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:55,038 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-18 09:53:55,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:53:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-18 09:53:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:53:55,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:55,039 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-18 09:53:55,040 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:55,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-18 09:53:55,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:55,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:55,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:53:56,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:56,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:56,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:56,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:56,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:56,079 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:56,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:56,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:53:56,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:56,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:53:56,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:53:59,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:59,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-18 09:53:59,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:59,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:53:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:53:59,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:53:59,046 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-18 09:53:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:59,197 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-18 09:53:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:53:59,197 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-18 09:53:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:59,198 INFO L225 Difference]: With dead ends: 133 [2019-02-18 09:53:59,198 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:53:59,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:53:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:53:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-18 09:53:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:53:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-18 09:53:59,203 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-18 09:53:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:59,203 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-18 09:53:59,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:53:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-18 09:53:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:53:59,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:59,204 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-18 09:53:59,204 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:59,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-18 09:53:59,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:59,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:59,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:59,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:54:00,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:00,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:00,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:00,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:00,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:00,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:00,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:00,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:00,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:00,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:54:01,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:54:03,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:03,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-18 09:54:03,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:03,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:54:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:54:03,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:54:03,116 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-18 09:54:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:03,274 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-18 09:54:03,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:54:03,274 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-18 09:54:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:03,275 INFO L225 Difference]: With dead ends: 136 [2019-02-18 09:54:03,276 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:54:03,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:54:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:54:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-18 09:54:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:54:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-18 09:54:03,280 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-18 09:54:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:03,280 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-18 09:54:03,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:54:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-18 09:54:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-18 09:54:03,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:03,281 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-18 09:54:03,282 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-18 09:54:03,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:03,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:03,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:03,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:03,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:54:04,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:04,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:04,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:04,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:04,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:04,473 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:04,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:04,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:04,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:54:04,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:54:06,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:06,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-18 09:54:06,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:06,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:54:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:54:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:54:06,790 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-18 09:54:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:07,294 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-18 09:54:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:54:07,295 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-18 09:54:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:07,295 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:54:07,295 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:54:07,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:54:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:54:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-18 09:54:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:54:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-18 09:54:07,300 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-18 09:54:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:07,300 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-18 09:54:07,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:54:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-18 09:54:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:54:07,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:07,300 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-18 09:54:07,301 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-18 09:54:07,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:07,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:07,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:07,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:54:08,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:08,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:08,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:08,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:08,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:08,352 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:08,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:08,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:09,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-18 09:54:09,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:09,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:54:09,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:54:11,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:11,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-02-18 09:54:11,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:11,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:54:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:54:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:54:11,354 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-18 09:54:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:12,353 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-18 09:54:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:54:12,354 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-18 09:54:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:12,355 INFO L225 Difference]: With dead ends: 142 [2019-02-18 09:54:12,355 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:54:12,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:54:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:54:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-18 09:54:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 09:54:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-18 09:54:12,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-18 09:54:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:12,360 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-18 09:54:12,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:54:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-18 09:54:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-18 09:54:12,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:12,361 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-18 09:54:12,361 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-18 09:54:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:12,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:12,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:54:14,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:14,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:14,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:14,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:14,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:14,121 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:14,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:14,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:14,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:14,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:14,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:54:14,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:54:16,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:16,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-18 09:54:16,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:16,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:54:16,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:54:16,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:16,596 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-18 09:54:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:16,786 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-18 09:54:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:54:16,786 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-18 09:54:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:16,787 INFO L225 Difference]: With dead ends: 145 [2019-02-18 09:54:16,787 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:54:16,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:54:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-18 09:54:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:54:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-18 09:54:16,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-18 09:54:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:16,792 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-18 09:54:16,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:54:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-18 09:54:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 09:54:16,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:16,793 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-18 09:54:16,793 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-18 09:54:16,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:16,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:16,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:16,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:54:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:17,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:17,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:17,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:17,893 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:17,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:17,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:17,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:54:18,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:54:20,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:20,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-18 09:54:20,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:20,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:54:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:54:20,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:54:20,840 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-18 09:54:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:21,126 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-18 09:54:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:54:21,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-18 09:54:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:21,127 INFO L225 Difference]: With dead ends: 148 [2019-02-18 09:54:21,127 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:54:21,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:54:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:54:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-18 09:54:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-18 09:54:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-18 09:54:21,130 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-18 09:54:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:21,131 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-18 09:54:21,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:54:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-18 09:54:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-18 09:54:21,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:21,132 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-18 09:54:21,132 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-18 09:54:21,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:21,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:21,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:21,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:54:24,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:24,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:24,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:24,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:24,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:24,105 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:24,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:24,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:25,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:54:25,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:25,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:54:25,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:54:28,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:28,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-18 09:54:28,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:28,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:54:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:54:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:54:28,556 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-18 09:54:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:29,027 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-18 09:54:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:54:29,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-18 09:54:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:29,028 INFO L225 Difference]: With dead ends: 151 [2019-02-18 09:54:29,028 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:54:29,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:54:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:54:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-18 09:54:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:54:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-18 09:54:29,033 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-18 09:54:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:29,034 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-18 09:54:29,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:54:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-18 09:54:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:54:29,035 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:29,035 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-18 09:54:29,035 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-18 09:54:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:29,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:29,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:54:30,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:30,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:30,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:30,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:30,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:30,990 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:30,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:30,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:31,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:31,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:31,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:54:31,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:54:33,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:33,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-18 09:54:33,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:33,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:54:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:54:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:33,714 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-18 09:54:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:33,940 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-18 09:54:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:54:33,941 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-18 09:54:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:33,941 INFO L225 Difference]: With dead ends: 154 [2019-02-18 09:54:33,942 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:54:33,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:54:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-18 09:54:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 09:54:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-18 09:54:33,947 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-18 09:54:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:33,947 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-18 09:54:33,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:54:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-18 09:54:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-18 09:54:33,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:33,948 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-18 09:54:33,948 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:33,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:33,948 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-18 09:54:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:33,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:33,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:54:35,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:35,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:35,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:35,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:35,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:35,609 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:35,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:35,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:35,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:54:35,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:54:38,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:38,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-18 09:54:38,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:38,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:54:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:54:38,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:54:38,404 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-18 09:54:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:38,655 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-18 09:54:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:54:38,655 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-18 09:54:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:38,656 INFO L225 Difference]: With dead ends: 157 [2019-02-18 09:54:38,656 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:54:38,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:54:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:54:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-18 09:54:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:54:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-18 09:54:38,663 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-18 09:54:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:38,663 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-18 09:54:38,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:54:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-18 09:54:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:54:38,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:38,664 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-18 09:54:38,664 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-18 09:54:38,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:54:40,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:40,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:40,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:40,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:40,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:40,092 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:40,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:40,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:41,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-18 09:54:41,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:41,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:54:41,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:54:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:43,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-18 09:54:43,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:43,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:54:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:54:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:54:43,956 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-18 09:54:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:44,287 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-18 09:54:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:54:44,288 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-18 09:54:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:44,289 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:54:44,289 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:54:44,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:54:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:54:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-18 09:54:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-18 09:54:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-18 09:54:44,296 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-18 09:54:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:44,296 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-18 09:54:44,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:54:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-18 09:54:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-18 09:54:44,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:44,297 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-18 09:54:44,298 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:44,298 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-18 09:54:44,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:44,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:44,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:54:45,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:45,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:45,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:45,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:45,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:45,638 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:45,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:45,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:45,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:45,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:45,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:54:45,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:54:48,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:48,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-18 09:54:48,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:48,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:54:48,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:54:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:48,731 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-18 09:54:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:49,038 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-18 09:54:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:54:49,038 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-18 09:54:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:49,039 INFO L225 Difference]: With dead ends: 163 [2019-02-18 09:54:49,039 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:54:49,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:54:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-18 09:54:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 09:54:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-18 09:54:49,044 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-18 09:54:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:49,044 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-18 09:54:49,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:54:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-18 09:54:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 09:54:49,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:49,045 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-18 09:54:49,045 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-18 09:54:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:49,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:49,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:54:50,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:50,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:50,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:50,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:50,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:50,575 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:50,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:50,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:54:50,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:54:53,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:53,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-18 09:54:53,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:53,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:54:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:54:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:54:53,670 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-18 09:54:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:53,980 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-18 09:54:53,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:54:53,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-18 09:54:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:53,982 INFO L225 Difference]: With dead ends: 166 [2019-02-18 09:54:53,982 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:54:53,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:54:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:54:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-18 09:54:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:54:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-18 09:54:53,986 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-18 09:54:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:53,986 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-18 09:54:53,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:54:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-18 09:54:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-18 09:54:53,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:53,987 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-18 09:54:53,987 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-18 09:54:53,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:53,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:53,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:53,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:54:55,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:55,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:55,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:55,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:55,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:55,395 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:55,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:55,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:56,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-18 09:54:56,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:56,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:56,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:54:56,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:56,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:56,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9