java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:35:02,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:35:02,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:35:02,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:35:02,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:35:02,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:35:02,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:35:02,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:35:02,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:35:02,643 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:35:02,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:35:02,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:35:02,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:35:02,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:35:02,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:35:02,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:35:02,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:35:02,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:35:02,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:35:02,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:35:02,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:35:02,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:35:02,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:35:02,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:35:02,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:35:02,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:35:02,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:35:02,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:35:02,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:35:02,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:35:02,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:35:02,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:35:02,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:35:02,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:35:02,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:35:02,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:35:02,678 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:35:02,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:35:02,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:35:02,699 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:35:02,699 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:35:02,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:35:02,700 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:35:02,700 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:35:02,700 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:35:02,700 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:35:02,700 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:35:02,701 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:35:02,701 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:35:02,701 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:35:02,702 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:35:02,702 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:35:02,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:35:02,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:35:02,703 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:35:02,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:35:02,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:35:02,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:35:02,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:35:02,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:35:02,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:35:02,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:35:02,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:35:02,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:35:02,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:35:02,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:35:02,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:35:02,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:35:02,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:35:02,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:35:02,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:35:02,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:35:02,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:35:02,708 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:35:02,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:35:02,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:35:02,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:35:02,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:35:02,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:35:02,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:35:02,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:35:02,763 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:35:02,764 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:35:02,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2018-12-03 15:35:02,766 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-12-03 15:35:02,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:35:02,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:35:02,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:35:02,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:35:02,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:35:02,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:35:02,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:35:02,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:35:02,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:35:02,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... [2018-12-03 15:35:02,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:35:02,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:35:02,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:35:02,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:35:02,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:35:02,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:35:02,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:35:03,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:35:03,158 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:35:03,158 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:35:03 BoogieIcfgContainer [2018-12-03 15:35:03,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:35:03,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:35:03,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:35:03,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:35:03,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:35:02" (1/2) ... [2018-12-03 15:35:03,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5919b0a6 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:35:03, skipping insertion in model container [2018-12-03 15:35:03,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:35:03" (2/2) ... [2018-12-03 15:35:03,169 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-12-03 15:35:03,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:35:03,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:35:03,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:35:03,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:35:03,244 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:35:03,244 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:35:03,244 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:35:03,244 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:35:03,245 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:35:03,246 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:35:03,246 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:35:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 15:35:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:35:03,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:03,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:35:03,284 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:03,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:35:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:03,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:03,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:35:03,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:35:03,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:35:03,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:35:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:35:03,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:35:03,479 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 15:35:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:03,577 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 15:35:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:35:03,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:35:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:03,589 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:35:03,589 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:35:03,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:35:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:35:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:35:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:35:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:35:03,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2018-12-03 15:35:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:03,627 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:35:03,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:35:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:35:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:35:03,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:03,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:35:03,628 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:03,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash 28851306, now seen corresponding path program 1 times [2018-12-03 15:35:03,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:03,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:03,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:03,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:03,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:03,720 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:35:03,721 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14] [2018-12-03 15:35:03,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:35:03,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:35:03,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:35:03,995 INFO L272 AbstractInterpreter]: Visited 5 different actions 18 times. Merged at 4 different actions 10 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:35:04,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:04,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:35:04,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:04,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:04,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,308 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:35:04,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2018-12-03 15:35:04,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:35:04,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:35:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:35:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:35:04,310 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-03 15:35:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:04,349 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 15:35:04,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:35:04,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:35:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:04,350 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:35:04,351 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:35:04,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:35:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:35:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 15:35:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:35:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 15:35:04,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-03 15:35:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:04,356 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 15:35:04,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:35:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 15:35:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:35:04,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:04,357 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 15:35:04,357 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:04,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1956367763, now seen corresponding path program 1 times [2018-12-03 15:35:04,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:04,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:04,391 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 15:35:04,391 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14], [16] [2018-12-03 15:35:04,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:35:04,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:35:04,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:35:04,456 INFO L272 AbstractInterpreter]: Visited 6 different actions 24 times. Merged at 5 different actions 12 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:35:04,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:04,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:35:04,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:04,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:04,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:04,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:35:04,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:04,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:35:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:35:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:35:04,584 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 15:35:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:04,643 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-03 15:35:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:35:04,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 15:35:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:04,645 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:35:04,645 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:35:04,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:35:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:35:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:35:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:35:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:35:04,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 7 [2018-12-03 15:35:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:04,652 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:35:04,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:35:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:35:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:35:04,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:04,653 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 15:35:04,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:04,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1128035974, now seen corresponding path program 2 times [2018-12-03 15:35:04,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:04,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:04,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:04,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:04,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:04,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:04,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:04,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:04,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:35:04,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:04,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:04,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:05,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 15:35:05,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:05,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:35:05,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:35:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:35:05,174 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 15:35:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:05,364 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-12-03 15:35:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:35:05,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 15:35:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:05,367 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:35:05,367 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:35:05,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:35:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:35:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-03 15:35:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:35:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-03 15:35:05,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2018-12-03 15:35:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:05,375 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-03 15:35:05,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:35:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-12-03 15:35:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:35:05,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:05,376 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 15:35:05,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:05,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1884090419, now seen corresponding path program 3 times [2018-12-03 15:35:05,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:05,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:05,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:05,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:05,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:05,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:05,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:05,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:05,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:05,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:05,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:05,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:05,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:05,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:05,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:05,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:35:05,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:05,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:35:05,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:35:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:35:05,593 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2018-12-03 15:35:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:05,650 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-03 15:35:05,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:35:05,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 15:35:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:05,655 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:35:05,655 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:35:05,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:35:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:35:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:35:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:35:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 15:35:05,661 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-12-03 15:35:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:05,661 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 15:35:05,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:35:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 15:35:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:35:05,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:05,662 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 15:35:05,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:05,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1749669146, now seen corresponding path program 4 times [2018-12-03 15:35:05,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:05,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:05,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:05,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:05,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:05,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:05,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:05,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:05,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:05,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:05,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:05,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:05,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:05,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:05,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:06,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:06,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:35:06,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:06,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:35:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:35:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:35:06,172 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 7 states. [2018-12-03 15:35:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:06,236 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-03 15:35:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:35:06,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 15:35:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:06,238 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:35:06,238 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:35:06,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:35:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:35:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:35:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:35:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 15:35:06,244 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-12-03 15:35:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:06,244 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 15:35:06,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:35:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 15:35:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:35:06,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:06,245 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 15:35:06,245 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:06,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1419844673, now seen corresponding path program 5 times [2018-12-03 15:35:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:06,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:06,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:35:06,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:06,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:06,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:06,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:06,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:06,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:06,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:06,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:06,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:35:06,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:06,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:35:06,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:35:06,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:06,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 15:35:06,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:06,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:35:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:35:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:35:06,638 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2018-12-03 15:35:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:06,759 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-12-03 15:35:06,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:35:06,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 15:35:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:06,760 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:35:06,761 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:35:06,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:35:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:35:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 15:35:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:35:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-03 15:35:06,767 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-12-03 15:35:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:06,767 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 15:35:06,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:35:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-03 15:35:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:35:06,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:06,768 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 15:35:06,769 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:06,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2075300015, now seen corresponding path program 6 times [2018-12-03 15:35:06,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:06,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:06,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:06,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:06,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:06,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:06,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:06,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:06,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:06,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:06,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:06,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:06,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:06,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:06,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:07,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:07,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:35:07,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:07,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:35:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:35:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:35:07,174 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2018-12-03 15:35:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:07,232 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-12-03 15:35:07,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:35:07,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 15:35:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:07,234 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:35:07,234 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:35:07,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:35:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:35:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:35:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:35:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 15:35:07,240 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2018-12-03 15:35:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:07,240 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 15:35:07,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:35:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 15:35:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:35:07,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:07,242 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 15:35:07,242 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:07,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2095480120, now seen corresponding path program 7 times [2018-12-03 15:35:07,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:07,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:07,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:07,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:07,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:07,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:07,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:07,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:07,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:07,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:07,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:07,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:07,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:07,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:07,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:07,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:35:07,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:07,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:35:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:35:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:35:07,805 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 10 states. [2018-12-03 15:35:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:07,862 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-03 15:35:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:35:07,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 15:35:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:07,864 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:35:07,864 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:35:07,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:35:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:35:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:35:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:35:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 15:35:07,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2018-12-03 15:35:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:07,871 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 15:35:07,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:35:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 15:35:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:35:07,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:07,872 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 15:35:07,872 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:07,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1284264609, now seen corresponding path program 8 times [2018-12-03 15:35:07,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:07,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:07,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:35:07,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:07,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:07,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:07,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:07,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:07,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:08,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:08,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:08,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:35:08,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:08,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 15:35:08,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 15:35:08,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:08,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 15:35:08,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:08,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:35:08,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:35:08,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:35:08,456 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2018-12-03 15:35:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:08,854 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-03 15:35:08,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:35:08,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 15:35:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:08,855 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:35:08,855 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:35:08,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:35:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:35:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 15:35:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:35:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-03 15:35:08,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2018-12-03 15:35:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:08,862 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-03 15:35:08,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:35:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-03 15:35:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:35:08,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:08,863 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 15:35:08,863 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:08,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1943640559, now seen corresponding path program 9 times [2018-12-03 15:35:08,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:08,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:08,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:09,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:09,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:09,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:09,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:09,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:09,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:09,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:09,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:09,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:09,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:09,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:35:09,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:35:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:35:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:35:09,308 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 12 states. [2018-12-03 15:35:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:09,374 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-12-03 15:35:09,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:35:09,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 15:35:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:09,375 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:35:09,376 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:35:09,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:35:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:35:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:35:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:35:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 15:35:09,382 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2018-12-03 15:35:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:09,382 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 15:35:09,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:35:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 15:35:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:35:09,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:09,384 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 15:35:09,384 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:09,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:09,385 INFO L82 PathProgramCache]: Analyzing trace with hash 114675926, now seen corresponding path program 10 times [2018-12-03 15:35:09,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:09,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:09,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:09,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:09,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:09,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:09,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:09,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:09,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:09,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:09,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:09,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:09,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:09,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:09,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:10,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:10,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:35:10,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:10,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:35:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:35:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:35:10,146 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 13 states. [2018-12-03 15:35:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:10,191 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-03 15:35:10,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:35:10,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 15:35:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:10,192 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:35:10,192 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:35:10,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:35:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:35:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:35:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:35:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 15:35:10,199 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2018-12-03 15:35:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:10,199 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 15:35:10,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:35:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 15:35:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:35:10,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:10,200 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 15:35:10,201 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:10,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash -878712323, now seen corresponding path program 11 times [2018-12-03 15:35:10,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:10,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:10,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:10,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:35:10,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:10,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:10,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:10,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:10,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:10,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:10,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:10,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:35:10,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:10,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:35:10,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:35:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 15:35:10,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:35:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:35:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:35:10,694 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 20 states. [2018-12-03 15:35:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:10,803 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-12-03 15:35:10,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:35:10,803 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 15:35:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:10,804 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:35:10,804 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:35:10,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:35:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:35:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 15:35:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:35:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-03 15:35:10,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2018-12-03 15:35:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:10,810 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-03 15:35:10,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:35:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-03 15:35:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:35:10,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:10,811 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 15:35:10,812 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:10,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash 361336845, now seen corresponding path program 12 times [2018-12-03 15:35:10,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:10,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:10,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:10,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:10,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:10,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:10,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:10,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:10,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:10,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:10,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:10,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:10,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:11,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:11,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:11,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:11,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:11,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:35:11,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:35:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:35:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:35:11,611 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 15 states. [2018-12-03 15:35:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:11,683 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-12-03 15:35:11,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:35:11,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 15:35:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:11,685 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:35:11,686 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:35:11,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:35:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:35:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:35:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:35:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 15:35:11,693 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2018-12-03 15:35:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:11,693 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 15:35:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:35:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 15:35:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:35:11,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:11,695 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 15:35:11,695 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:11,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 632287220, now seen corresponding path program 13 times [2018-12-03 15:35:11,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:11,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:11,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:11,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:11,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:11,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:11,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:11,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:11,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:11,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:11,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:11,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:12,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:35:12,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:12,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:35:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:35:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:35:12,549 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 16 states. [2018-12-03 15:35:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:12,614 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-03 15:35:12,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:35:12,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 15:35:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:12,616 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:35:12,617 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:35:12,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:35:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:35:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:35:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:35:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 15:35:12,625 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2018-12-03 15:35:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:12,625 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 15:35:12,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:35:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 15:35:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:35:12,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:12,627 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 15:35:12,627 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:12,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash -977407461, now seen corresponding path program 14 times [2018-12-03 15:35:12,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:12,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:12,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:12,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:35:12,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:12,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:12,945 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:12,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:12,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:12,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:12,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:12,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:12,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:35:12,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:12,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 15:35:13,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 15:35:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 15:35:13,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:13,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:35:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:35:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:35:13,370 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 24 states. [2018-12-03 15:35:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:13,519 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-12-03 15:35:13,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:35:13,519 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 15:35:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:13,520 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:35:13,520 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:35:13,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:35:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:35:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 15:35:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:35:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 15:35:13,527 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 43 [2018-12-03 15:35:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:13,528 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 15:35:13,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:35:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 15:35:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:35:13,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:13,529 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 15:35:13,529 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:13,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1433235883, now seen corresponding path program 15 times [2018-12-03 15:35:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:13,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:13,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:13,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:13,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:13,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:13,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:13,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:13,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:13,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:13,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:13,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:13,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:13,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:14,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:14,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:35:14,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:14,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:35:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:35:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:35:14,508 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 18 states. [2018-12-03 15:35:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:14,623 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-03 15:35:14,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:35:14,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 15:35:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:14,624 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:35:14,625 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:35:14,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:35:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:35:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:35:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:35:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 15:35:14,635 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 47 [2018-12-03 15:35:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:14,636 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 15:35:14,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:35:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 15:35:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:35:14,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:14,638 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 15:35:14,638 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:14,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:14,638 INFO L82 PathProgramCache]: Analyzing trace with hash 243595922, now seen corresponding path program 16 times [2018-12-03 15:35:14,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:14,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:14,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:14,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:14,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:14,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:14,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:14,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:14,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:14,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:14,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:14,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:14,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:14,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:14,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:35:15,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:15,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:35:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:35:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:35:15,737 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 19 states. [2018-12-03 15:35:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:15,809 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-03 15:35:15,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:35:15,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 15:35:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:15,810 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:35:15,811 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:35:15,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:35:15,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:35:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:35:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:35:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 15:35:15,818 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2018-12-03 15:35:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:15,819 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 15:35:15,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:35:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 15:35:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:35:15,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:15,820 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 15:35:15,820 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:15,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash -539105863, now seen corresponding path program 17 times [2018-12-03 15:35:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:15,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:15,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:35:16,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:16,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:16,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:16,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:16,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:16,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:16,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:16,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:16,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:35:16,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:16,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 15:35:16,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 15:35:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 15:35:16,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:16,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:35:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:35:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:35:16,997 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2018-12-03 15:35:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:17,452 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-12-03 15:35:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:35:17,453 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 15:35:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:17,453 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:35:17,454 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:35:17,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:35:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:35:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 15:35:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:35:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-03 15:35:17,459 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 51 [2018-12-03 15:35:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:17,459 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-03 15:35:17,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:35:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-12-03 15:35:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:35:17,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:17,461 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 15:35:17,461 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:17,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1223860535, now seen corresponding path program 18 times [2018-12-03 15:35:17,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:17,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:17,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:18,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:18,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:18,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:18,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:18,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:18,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:18,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:18,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:18,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:18,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:19,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:19,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:35:19,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:19,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:35:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:35:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:35:19,422 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 21 states. [2018-12-03 15:35:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:19,622 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-12-03 15:35:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:35:19,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 15:35:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:19,623 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:35:19,623 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:35:19,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:35:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:35:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:35:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:35:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 15:35:19,630 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 55 [2018-12-03 15:35:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:19,630 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 15:35:19,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:35:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 15:35:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:35:19,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:19,632 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 15:35:19,632 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:19,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1914892112, now seen corresponding path program 19 times [2018-12-03 15:35:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:19,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:19,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:19,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:19,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:19,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:19,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:19,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:19,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:19,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:20,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:20,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:20,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:20,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:35:20,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:20,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:35:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:35:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:35:20,517 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 22 states. [2018-12-03 15:35:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:20,592 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-12-03 15:35:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:35:20,593 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 15:35:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:20,594 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:35:20,594 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:35:20,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:35:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:35:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:35:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:35:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 15:35:20,599 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 57 [2018-12-03 15:35:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:20,599 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 15:35:20,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:35:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 15:35:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:35:20,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:20,601 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 15:35:20,601 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -276306729, now seen corresponding path program 20 times [2018-12-03 15:35:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:20,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:20,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:35:21,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:21,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:21,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:21,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:21,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:21,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:21,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:21,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:21,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:35:21,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:21,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 15:35:21,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 15:35:21,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:21,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 15:35:21,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:21,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:35:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:35:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:35:21,509 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 32 states. [2018-12-03 15:35:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:21,667 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-03 15:35:21,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:35:21,670 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 15:35:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:21,671 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:35:21,671 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:35:21,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:35:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:35:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 15:35:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:35:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-03 15:35:21,678 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 59 [2018-12-03 15:35:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:21,678 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-03 15:35:21,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:35:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-03 15:35:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:35:21,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:21,679 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 15:35:21,680 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1466529639, now seen corresponding path program 21 times [2018-12-03 15:35:21,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:21,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:21,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:21,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:21,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:21,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:21,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:21,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:21,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:21,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:22,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:22,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:22,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:22,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:22,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:22,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:35:22,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:22,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:35:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:35:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:35:22,595 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 24 states. [2018-12-03 15:35:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:22,668 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-03 15:35:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:35:22,669 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 15:35:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:22,670 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:35:22,670 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:35:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:35:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:35:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:35:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:35:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 15:35:22,675 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 63 [2018-12-03 15:35:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:22,675 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 15:35:22,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:35:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 15:35:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:35:22,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:22,676 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 15:35:22,676 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:22,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash 163074638, now seen corresponding path program 22 times [2018-12-03 15:35:22,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:22,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:22,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:22,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:22,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:22,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:22,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:22,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:22,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:22,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:22,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:23,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:23,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:24,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:35:24,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:24,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:35:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:35:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:35:24,087 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 25 states. [2018-12-03 15:35:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:24,185 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-12-03 15:35:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:35:24,186 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 15:35:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:24,187 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:35:24,187 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:35:24,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:35:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:35:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:35:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:35:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 15:35:24,193 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 65 [2018-12-03 15:35:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:24,194 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 15:35:24,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:35:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 15:35:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:35:24,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:24,195 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 15:35:24,195 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:24,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:24,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1673269109, now seen corresponding path program 23 times [2018-12-03 15:35:24,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:24,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:24,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:35:24,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:24,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:24,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:24,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:24,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:24,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:24,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:24,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:24,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:35:24,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:24,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 15:35:24,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 15:35:25,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:25,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 15:35:25,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:25,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:35:25,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:35:25,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:35:25,206 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 36 states. [2018-12-03 15:35:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:25,491 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-12-03 15:35:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:35:25,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 15:35:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:25,493 INFO L225 Difference]: With dead ends: 94 [2018-12-03 15:35:25,493 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:35:25,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:35:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:35:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 15:35:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:35:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-12-03 15:35:25,499 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 67 [2018-12-03 15:35:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:25,499 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-12-03 15:35:25,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:35:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-12-03 15:35:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:35:25,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:25,500 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 15:35:25,501 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:25,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1861868421, now seen corresponding path program 24 times [2018-12-03 15:35:25,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:25,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:25,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:25,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:25,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:26,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:26,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:26,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:26,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:26,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:26,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:26,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:26,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:26,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:26,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:26,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:26,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:26,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:26,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:35:26,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:26,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:35:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:35:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:26,792 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 27 states. [2018-12-03 15:35:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:26,906 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2018-12-03 15:35:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:35:26,906 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 15:35:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:26,907 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:35:26,907 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:35:26,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:35:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:35:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:35:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 15:35:26,914 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 71 [2018-12-03 15:35:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:26,914 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 15:35:26,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:35:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 15:35:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:35:26,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:26,915 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 15:35:26,915 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:26,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash 59694956, now seen corresponding path program 25 times [2018-12-03 15:35:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:26,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:26,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:27,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:27,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:27,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:27,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:27,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:27,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:27,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:27,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:27,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:27,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:28,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:28,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 15:35:28,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:28,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:35:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:35:28,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:28,557 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 28 states. [2018-12-03 15:35:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:28,753 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2018-12-03 15:35:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:35:28,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 15:35:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:28,754 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:35:28,754 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:35:28,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:35:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:35:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:35:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 15:35:28,758 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 73 [2018-12-03 15:35:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:28,759 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 15:35:28,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:35:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 15:35:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:35:28,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:28,760 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 15:35:28,760 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:28,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -957184621, now seen corresponding path program 26 times [2018-12-03 15:35:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:28,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:28,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:35:29,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:29,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:29,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:29,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:29,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:29,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:29,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:29,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:35:29,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:29,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:29,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 15:35:29,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 15:35:30,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 15:35:30,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:30,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:35:30,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:35:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:35:30,070 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 40 states. [2018-12-03 15:35:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:30,239 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-03 15:35:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:35:30,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 15:35:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:30,241 INFO L225 Difference]: With dead ends: 104 [2018-12-03 15:35:30,241 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:35:30,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:35:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:35:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 15:35:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:35:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-12-03 15:35:30,247 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 75 [2018-12-03 15:35:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:30,247 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-12-03 15:35:30,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:35:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-12-03 15:35:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:35:30,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:30,248 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 15:35:30,248 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:30,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1403956003, now seen corresponding path program 27 times [2018-12-03 15:35:30,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:30,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:30,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:30,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:30,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:30,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:30,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:30,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:30,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:30,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:30,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:30,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:30,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:30,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:31,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 15:35:31,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:31,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:35:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:35:31,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:31,442 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 30 states. [2018-12-03 15:35:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:31,521 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-12-03 15:35:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:35:31,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 15:35:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:31,522 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:35:31,522 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:35:31,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:35:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:35:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:35:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 15:35:31,528 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 79 [2018-12-03 15:35:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:31,528 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 15:35:31,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:35:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 15:35:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:35:31,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:31,529 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 15:35:31,529 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:31,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:31,529 INFO L82 PathProgramCache]: Analyzing trace with hash 441505802, now seen corresponding path program 28 times [2018-12-03 15:35:31,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:31,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:31,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:32,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:32,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:32,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:32,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:32,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:32,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:32,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:32,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:32,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:32,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:34,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:34,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 15:35:34,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:34,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:35:34,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:35:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:34,958 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 31 states. [2018-12-03 15:35:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:35,095 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2018-12-03 15:35:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:35:35,096 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 15:35:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:35,097 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:35:35,098 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:35:35,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:35:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:35:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:35:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 15:35:35,105 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 81 [2018-12-03 15:35:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:35,105 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 15:35:35,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:35:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 15:35:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:35:35,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:35,106 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 15:35:35,106 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:35,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1055168719, now seen corresponding path program 29 times [2018-12-03 15:35:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:35,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:35,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:35:35,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:35,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:35,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:35,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:35,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:35,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:35,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:35,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:35,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:35:35,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:35,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 15:35:36,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 15:35:36,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:36,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 15:35:36,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:35:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:35:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:35:36,555 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 44 states. [2018-12-03 15:35:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:36,744 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-12-03 15:35:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:35:36,744 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 15:35:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:36,745 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:35:36,745 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:35:36,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:35:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:35:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 15:35:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:35:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-03 15:35:36,749 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 83 [2018-12-03 15:35:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:36,750 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-03 15:35:36,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:35:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-03 15:35:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:35:36,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:36,751 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 15:35:36,751 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:36,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash -84933055, now seen corresponding path program 30 times [2018-12-03 15:35:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:36,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:36,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:37,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:37,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:37,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:37,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:37,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:37,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:37,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:37,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:37,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:37,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:37,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:38,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 15:35:38,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:38,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:35:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:35:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:38,325 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 33 states. [2018-12-03 15:35:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:38,476 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2018-12-03 15:35:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:35:38,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 15:35:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:38,478 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:35:38,478 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:35:38,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:35:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 15:35:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:35:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 15:35:38,484 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 87 [2018-12-03 15:35:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:38,484 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 15:35:38,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:35:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 15:35:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:35:38,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:38,485 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 15:35:38,486 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:38,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:38,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1939448792, now seen corresponding path program 31 times [2018-12-03 15:35:38,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:38,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:38,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:38,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:38,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:39,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:39,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:39,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:39,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:39,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:39,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:39,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:40,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:40,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 15:35:40,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:40,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:35:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:35:40,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:40,099 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 34 states. [2018-12-03 15:35:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:40,239 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-12-03 15:35:40,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:35:40,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 15:35:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:40,240 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:35:40,241 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:35:40,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:35:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:35:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:35:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 15:35:40,248 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 89 [2018-12-03 15:35:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:40,248 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 15:35:40,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:35:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 15:35:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:35:40,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:40,249 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 15:35:40,249 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:40,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1717644209, now seen corresponding path program 32 times [2018-12-03 15:35:40,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:40,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:40,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:40,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:40,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:35:40,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:40,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:40,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:40,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:40,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:40,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:40,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:40,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:40,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:35:40,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:40,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 15:35:41,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 15:35:42,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:42,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 15:35:42,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:42,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:35:42,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:35:42,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:35:42,208 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 48 states. [2018-12-03 15:35:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:42,420 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-12-03 15:35:42,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:35:42,421 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 15:35:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:42,422 INFO L225 Difference]: With dead ends: 124 [2018-12-03 15:35:42,422 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:35:42,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:35:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:35:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 15:35:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:35:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-12-03 15:35:42,429 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 91 [2018-12-03 15:35:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:42,429 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-12-03 15:35:42,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:35:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-12-03 15:35:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:35:42,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:42,430 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 15:35:42,430 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:42,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -73528097, now seen corresponding path program 33 times [2018-12-03 15:35:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:42,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:42,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:42,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:42,945 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:42,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:42,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:42,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:42,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:42,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:42,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:42,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:42,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:43,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:43,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 15:35:43,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:43,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:35:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:35:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:43,868 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 36 states. [2018-12-03 15:35:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:43,988 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-12-03 15:35:43,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:35:43,989 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 15:35:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:43,989 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:35:43,989 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:35:43,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:35:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:35:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:35:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 15:35:43,995 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 95 [2018-12-03 15:35:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:43,995 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 15:35:43,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:35:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 15:35:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:35:43,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:43,996 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 15:35:43,996 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:43,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash 967805894, now seen corresponding path program 34 times [2018-12-03 15:35:43,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:43,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:43,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:44,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:44,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:44,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:44,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:44,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:44,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:44,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:44,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:44,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:44,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:45,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:45,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 15:35:45,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:45,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:35:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:35:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:45,887 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 37 states. [2018-12-03 15:35:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:46,023 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2018-12-03 15:35:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:35:46,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 15:35:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:46,025 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:35:46,025 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:35:46,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:35:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:35:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:35:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 15:35:46,032 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 97 [2018-12-03 15:35:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:46,032 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 15:35:46,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:35:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 15:35:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:35:46,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:46,033 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 15:35:46,033 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:46,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash 962391277, now seen corresponding path program 35 times [2018-12-03 15:35:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:46,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:35:46,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:46,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:46,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:46,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:46,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:46,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:46,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:46,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:46,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:35:46,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:46,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 15:35:47,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 15:35:47,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:47,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 15:35:47,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:47,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:35:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:35:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:35:47,725 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 52 states. [2018-12-03 15:35:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:48,003 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-12-03 15:35:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:35:48,004 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 15:35:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:48,005 INFO L225 Difference]: With dead ends: 134 [2018-12-03 15:35:48,005 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:35:48,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:35:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:35:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 15:35:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:35:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-12-03 15:35:48,010 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 99 [2018-12-03 15:35:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:48,010 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-12-03 15:35:48,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:35:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-12-03 15:35:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:35:48,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:48,011 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 15:35:48,011 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:48,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:48,011 INFO L82 PathProgramCache]: Analyzing trace with hash 269541117, now seen corresponding path program 36 times [2018-12-03 15:35:48,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:48,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:48,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:48,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:48,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:48,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:48,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:48,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:48,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:48,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:48,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:48,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:48,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:48,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:49,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:49,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 15:35:49,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:49,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:35:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:35:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:49,934 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 39 states. [2018-12-03 15:35:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:50,128 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2018-12-03 15:35:50,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:35:50,129 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 15:35:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:50,130 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:35:50,130 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:35:50,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:35:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:35:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:35:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 15:35:50,136 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 103 [2018-12-03 15:35:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:50,136 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 15:35:50,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:35:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 15:35:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:35:50,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:50,137 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 15:35:50,137 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:50,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 629442276, now seen corresponding path program 37 times [2018-12-03 15:35:50,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:50,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:50,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:50,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:50,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:50,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:50,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:50,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:50,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:50,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:50,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:50,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:51,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:51,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 15:35:51,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:51,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:35:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:35:51,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:51,783 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 40 states. [2018-12-03 15:35:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:51,958 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2018-12-03 15:35:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:35:51,959 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 15:35:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:51,960 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:35:51,960 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:35:51,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:35:51,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:35:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:35:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 15:35:51,966 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 105 [2018-12-03 15:35:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:51,966 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 15:35:51,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:35:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 15:35:51,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:35:51,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:51,967 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 15:35:51,967 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:51,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1397894901, now seen corresponding path program 38 times [2018-12-03 15:35:51,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:51,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:35:52,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:52,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:52,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:52,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:52,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:52,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:52,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:52,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:52,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:35:52,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:52,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 15:35:53,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 15:35:53,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:53,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 15:35:53,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:53,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:35:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:35:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:35:53,935 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 56 states. [2018-12-03 15:35:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:54,219 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2018-12-03 15:35:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:35:54,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 15:35:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:54,225 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:35:54,225 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:35:54,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:35:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:35:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 15:35:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:35:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-03 15:35:54,231 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 107 [2018-12-03 15:35:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:54,231 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-03 15:35:54,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:35:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-03 15:35:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:35:54,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:54,232 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 15:35:54,232 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:54,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 404266139, now seen corresponding path program 39 times [2018-12-03 15:35:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:54,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:54,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:35:55,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:55,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:55,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:55,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:55,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:55,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:55,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:55,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:55,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:55,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:55,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:35:55,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:35:57,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:57,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 15:35:57,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:57,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:35:57,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:35:57,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:57,158 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 42 states. [2018-12-03 15:35:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:57,559 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2018-12-03 15:35:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:35:57,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 15:35:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:57,560 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:35:57,560 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:35:57,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:35:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:35:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 15:35:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:35:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 15:35:57,567 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 111 [2018-12-03 15:35:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:57,567 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 15:35:57,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:35:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 15:35:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:35:57,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:57,568 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 15:35:57,568 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:57,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2025155970, now seen corresponding path program 40 times [2018-12-03 15:35:57,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:57,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:57,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:35:58,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:58,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:58,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:58,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:58,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:58,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:35:58,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:58,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:58,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:35:58,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:36:00,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:00,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 15:36:00,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:00,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:36:00,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:36:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:00,349 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 43 states. [2018-12-03 15:36:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:00,937 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2018-12-03 15:36:00,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:36:00,937 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 15:36:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:00,939 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:36:00,939 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:36:00,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:36:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 15:36:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:36:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 15:36:00,944 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 113 [2018-12-03 15:36:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:00,945 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 15:36:00,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:36:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 15:36:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:36:00,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:00,945 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 15:36:00,946 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:00,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 627155113, now seen corresponding path program 41 times [2018-12-03 15:36:00,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:00,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:00,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:00,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:00,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:36:01,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:01,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:01,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:01,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:01,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:01,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:01,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:02,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:36:02,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:02,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 15:36:02,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 15:36:03,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:03,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 15:36:03,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:03,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:36:03,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:36:03,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:36:03,431 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 60 states. [2018-12-03 15:36:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:03,728 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-12-03 15:36:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:36:03,728 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 15:36:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:03,730 INFO L225 Difference]: With dead ends: 154 [2018-12-03 15:36:03,730 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:36:03,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:36:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:36:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 15:36:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:36:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-12-03 15:36:03,737 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 115 [2018-12-03 15:36:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:03,737 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-12-03 15:36:03,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:36:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-12-03 15:36:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:36:03,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:03,738 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 15:36:03,738 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:03,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1694669383, now seen corresponding path program 42 times [2018-12-03 15:36:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:03,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:03,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:04,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:04,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:04,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:04,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:04,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:04,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:04,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:04,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:04,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:04,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:04,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:04,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:05,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:05,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 15:36:05,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:05,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:36:05,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:36:05,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:05,958 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 45 states. [2018-12-03 15:36:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:06,204 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-12-03 15:36:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:36:06,205 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 15:36:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:06,206 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:36:06,206 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:36:06,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:36:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 15:36:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:36:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 15:36:06,214 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 119 [2018-12-03 15:36:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:06,214 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 15:36:06,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:36:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 15:36:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:36:06,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:06,215 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 15:36:06,215 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:06,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash 59400096, now seen corresponding path program 43 times [2018-12-03 15:36:06,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:06,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:06,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:06,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:06,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:07,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:07,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:07,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:07,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:07,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:07,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:07,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:07,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:07,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 15:36:09,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:09,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:36:09,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:36:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:09,122 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 46 states. [2018-12-03 15:36:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:09,273 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2018-12-03 15:36:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:36:09,273 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 15:36:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:09,274 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:36:09,274 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:36:09,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:36:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:36:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:36:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 15:36:09,280 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 121 [2018-12-03 15:36:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:09,280 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 15:36:09,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:36:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 15:36:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:36:09,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:09,281 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 15:36:09,281 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:09,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:09,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2092989383, now seen corresponding path program 44 times [2018-12-03 15:36:09,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:09,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:36:10,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:10,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:10,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:10,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:10,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:10,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:10,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:10,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:10,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:36:10,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:10,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 15:36:11,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 15:36:11,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:11,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 15:36:11,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:11,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:36:11,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:36:11,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:36:11,978 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 64 states. [2018-12-03 15:36:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:12,428 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-03 15:36:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:36:12,428 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 15:36:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:12,429 INFO L225 Difference]: With dead ends: 164 [2018-12-03 15:36:12,429 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 15:36:12,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:36:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 15:36:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 15:36:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:36:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-12-03 15:36:12,436 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 123 [2018-12-03 15:36:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:12,436 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-12-03 15:36:12,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:36:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-12-03 15:36:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 15:36:12,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:12,437 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 15:36:12,438 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:12,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash -914400681, now seen corresponding path program 45 times [2018-12-03 15:36:12,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:12,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:12,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:13,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:13,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:13,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:13,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:13,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:13,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:13,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:13,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:13,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:13,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:13,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:13,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:14,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:14,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 15:36:14,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:14,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:36:14,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:36:14,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:14,395 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 48 states. [2018-12-03 15:36:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:14,574 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-12-03 15:36:14,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:36:14,575 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 15:36:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:14,576 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:36:14,576 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:36:14,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:36:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:36:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:36:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 15:36:14,581 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 127 [2018-12-03 15:36:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:14,581 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 15:36:14,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:36:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 15:36:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:36:14,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:14,582 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 15:36:14,582 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:14,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1069776190, now seen corresponding path program 46 times [2018-12-03 15:36:14,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:14,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:14,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:14,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:14,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:15,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:15,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:15,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:15,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:15,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:15,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:15,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:15,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:15,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:15,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:16,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 15:36:16,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:16,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:36:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:36:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:16,823 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 49 states. [2018-12-03 15:36:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:17,042 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-12-03 15:36:17,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:36:17,043 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 15:36:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:17,044 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:36:17,044 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 15:36:17,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 15:36:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 15:36:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:36:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 15:36:17,053 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 129 [2018-12-03 15:36:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:17,053 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 15:36:17,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:36:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 15:36:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:36:17,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:17,054 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 15:36:17,055 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:17,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash 898269797, now seen corresponding path program 47 times [2018-12-03 15:36:17,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:17,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:17,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:17,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:17,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:36:18,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:18,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:18,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:18,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:18,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:18,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:18,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:18,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:18,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:36:18,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:18,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 15:36:19,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 15:36:20,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:20,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 15:36:20,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:20,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:36:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:36:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:36:20,822 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 68 states. [2018-12-03 15:36:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:21,394 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-12-03 15:36:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:36:21,395 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 15:36:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:21,396 INFO L225 Difference]: With dead ends: 174 [2018-12-03 15:36:21,396 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 15:36:21,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:36:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 15:36:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 15:36:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:36:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-12-03 15:36:21,406 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 131 [2018-12-03 15:36:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:21,407 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-12-03 15:36:21,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:36:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-12-03 15:36:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:36:21,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:21,408 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 15:36:21,408 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:21,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2712971, now seen corresponding path program 48 times [2018-12-03 15:36:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:21,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:21,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:36:23,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:23,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:23,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:23,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:23,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:23,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:23,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:23,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:23,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:23,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:23,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:36:23,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:36:24,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:24,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 15:36:24,735 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:24,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:36:24,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:36:24,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:24,736 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 51 states. [2018-12-03 15:36:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:24,936 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2018-12-03 15:36:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:36:24,936 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 15:36:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:24,937 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:36:24,937 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 15:36:24,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 15:36:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 15:36:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:36:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 15:36:24,942 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 135 [2018-12-03 15:36:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:24,943 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 15:36:24,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:36:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 15:36:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:36:24,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:24,943 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 15:36:24,944 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:24,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash -761731492, now seen corresponding path program 49 times [2018-12-03 15:36:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:24,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:24,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:36:26,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:26,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:26,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:26,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:26,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:26,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:26,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:26,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:26,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:36:26,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:36:27,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:27,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 15:36:27,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:36:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:36:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:27,261 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 52 states. [2018-12-03 15:36:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:27,461 INFO L93 Difference]: Finished difference Result 179 states and 216 transitions. [2018-12-03 15:36:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:36:27,462 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 15:36:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:27,463 INFO L225 Difference]: With dead ends: 179 [2018-12-03 15:36:27,464 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 15:36:27,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 15:36:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 15:36:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 15:36:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 15:36:27,468 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 137 [2018-12-03 15:36:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:27,468 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 15:36:27,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:36:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 15:36:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 15:36:27,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:27,470 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 15:36:27,470 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:27,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash -34089853, now seen corresponding path program 50 times [2018-12-03 15:36:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:27,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:27,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:28,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:28,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:28,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:28,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:28,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:28,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:28,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:28,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:28,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:36:28,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:28,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:36:28,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:36:29,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:29,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 15:36:29,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:29,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:36:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:36:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:36:29,006 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 23 states. [2018-12-03 15:36:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:29,105 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-03 15:36:29,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:36:29,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 15:36:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:29,106 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:36:29,107 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:36:29,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:36:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:36:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-12-03 15:36:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 15:36:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-12-03 15:36:29,113 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 139 [2018-12-03 15:36:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:29,113 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-12-03 15:36:29,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:36:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-12-03 15:36:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 15:36:29,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:29,115 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 15:36:29,115 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:29,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1920855678, now seen corresponding path program 51 times [2018-12-03 15:36:29,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:29,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:29,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:30,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:30,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:30,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:30,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:30,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:30,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:30,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:30,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:30,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:30,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:30,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:31,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:33,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:33,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 15:36:33,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:33,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:36:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:36:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:33,586 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 76 states. [2018-12-03 15:36:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:33,976 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2018-12-03 15:36:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:36:33,976 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 15:36:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:33,977 INFO L225 Difference]: With dead ends: 155 [2018-12-03 15:36:33,977 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 15:36:33,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 15:36:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-12-03 15:36:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 15:36:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2018-12-03 15:36:33,983 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 145 [2018-12-03 15:36:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:33,983 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2018-12-03 15:36:33,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:36:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2018-12-03 15:36:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 15:36:33,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:33,985 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 15:36:33,985 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:33,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1141465145, now seen corresponding path program 52 times [2018-12-03 15:36:33,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:33,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:33,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:34,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:34,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:34,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:34,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:34,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:34,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:36:34,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:34,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:35,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:36,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:38,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:38,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 15:36:38,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:36:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:36:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:38,235 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 79 states. [2018-12-03 15:36:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:38,770 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2018-12-03 15:36:38,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:36:38,771 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 15:36:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:38,772 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:36:38,772 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 15:36:38,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 15:36:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-12-03 15:36:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 15:36:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-12-03 15:36:38,778 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 151 [2018-12-03 15:36:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:38,778 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-12-03 15:36:38,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:36:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-12-03 15:36:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 15:36:38,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:38,779 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 15:36:38,779 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:38,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash -978757196, now seen corresponding path program 53 times [2018-12-03 15:36:38,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:38,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:38,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:39,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:39,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:39,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:39,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:39,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:39,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:39,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:39,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:36:39,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:39,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:36:39,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:36:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:40,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 15:36:40,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:40,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:36:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:36:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:40,237 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand 32 states. [2018-12-03 15:36:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:40,423 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2018-12-03 15:36:40,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:36:40,423 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 15:36:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:40,424 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:36:40,424 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 15:36:40,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 15:36:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-12-03 15:36:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 15:36:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-12-03 15:36:40,431 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 157 [2018-12-03 15:36:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:40,431 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-12-03 15:36:40,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:36:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-12-03 15:36:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 15:36:40,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:40,432 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 15:36:40,432 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:40,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1370944785, now seen corresponding path program 54 times [2018-12-03 15:36:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:40,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:40,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:41,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:41,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:41,126 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:41,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:41,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:41,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:41,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:41,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:41,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:41,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:41,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:42,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:43,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 15:36:43,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:43,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:36:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:36:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:43,956 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 85 states. [2018-12-03 15:36:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:44,543 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-12-03 15:36:44,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:36:44,544 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 15:36:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:44,544 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:36:44,545 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:36:44,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:36:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-12-03 15:36:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 15:36:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2018-12-03 15:36:44,552 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 163 [2018-12-03 15:36:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:44,552 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2018-12-03 15:36:44,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:36:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2018-12-03 15:36:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 15:36:44,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:44,553 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 15:36:44,554 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:44,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1011899414, now seen corresponding path program 55 times [2018-12-03 15:36:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:44,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:44,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:45,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:45,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:45,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:45,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:45,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:45,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:45,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:45,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:46,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:48,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 15:36:48,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:48,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:36:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:36:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:48,223 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand 88 states. [2018-12-03 15:36:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:48,947 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2018-12-03 15:36:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:36:48,947 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 15:36:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:48,948 INFO L225 Difference]: With dead ends: 179 [2018-12-03 15:36:48,948 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 15:36:48,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 15:36:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-12-03 15:36:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 15:36:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2018-12-03 15:36:48,954 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 169 [2018-12-03 15:36:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:48,954 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2018-12-03 15:36:48,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:36:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2018-12-03 15:36:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 15:36:48,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:48,955 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 15:36:48,955 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:48,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:48,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1166038181, now seen corresponding path program 56 times [2018-12-03 15:36:48,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:48,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:48,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:49,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:49,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:49,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:49,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:49,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:49,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:49,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:49,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:49,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 15:36:49,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:49,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:36:49,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:36:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:51,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 15:36:51,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:51,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:36:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:36:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:51,911 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand 41 states. [2018-12-03 15:36:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:52,123 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-12-03 15:36:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:36:52,123 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 15:36:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:52,124 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:36:52,124 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:36:52,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:36:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:36:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-12-03 15:36:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 15:36:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2018-12-03 15:36:52,133 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 175 [2018-12-03 15:36:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:52,133 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2018-12-03 15:36:52,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:36:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2018-12-03 15:36:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 15:36:52,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:52,134 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 15:36:52,134 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:52,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 406474016, now seen corresponding path program 57 times [2018-12-03 15:36:52,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:52,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:52,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:52,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:52,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:52,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:52,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:52,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:52,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:52,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:52,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:53,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:53,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:53,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:54,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:56,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 15:36:56,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:36:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:36:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:56,200 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand 94 states. [2018-12-03 15:36:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:56,967 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2018-12-03 15:36:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:36:56,967 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 15:36:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:56,968 INFO L225 Difference]: With dead ends: 191 [2018-12-03 15:36:56,968 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 15:36:56,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:36:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 15:36:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-12-03 15:36:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 15:36:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2018-12-03 15:36:56,973 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 181 [2018-12-03 15:36:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:56,974 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2018-12-03 15:36:56,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:36:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2018-12-03 15:36:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 15:36:56,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:56,975 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 15:36:56,975 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:56,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1338458789, now seen corresponding path program 58 times [2018-12-03 15:36:56,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:56,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:56,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:56,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:56,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:36:57,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:57,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:57,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:57,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:57,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:57,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:57,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:57,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:58,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:59,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:01,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:01,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 15:37:01,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:01,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:37:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:37:01,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:37:01,252 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 97 states. [2018-12-03 15:37:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:02,232 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-12-03 15:37:02,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:37:02,232 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 15:37:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:02,233 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:37:02,233 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 15:37:02,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:37:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 15:37:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-12-03 15:37:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 15:37:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-12-03 15:37:02,240 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 187 [2018-12-03 15:37:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:02,240 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-12-03 15:37:02,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:37:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-12-03 15:37:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 15:37:02,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:02,241 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 15:37:02,241 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:02,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1129130666, now seen corresponding path program 59 times [2018-12-03 15:37:02,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:02,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:37:03,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:03,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:03,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:03,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:03,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:03,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:03,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:03,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 15:37:03,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:03,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:37:03,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:37:04,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 15:37:04,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:04,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:37:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:37:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:37:04,249 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 50 states. [2018-12-03 15:37:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:04,583 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-12-03 15:37:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:37:04,583 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 15:37:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:04,584 INFO L225 Difference]: With dead ends: 203 [2018-12-03 15:37:04,584 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 15:37:04,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:37:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 15:37:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-12-03 15:37:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 15:37:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-12-03 15:37:04,591 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 193 [2018-12-03 15:37:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:04,591 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-12-03 15:37:04,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:37:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-12-03 15:37:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 15:37:04,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:04,593 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 15:37:04,593 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:04,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1833188079, now seen corresponding path program 60 times [2018-12-03 15:37:04,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:04,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:04,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:37:05,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:05,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:05,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:05,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:05,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:05,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:05,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:05,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:05,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:05,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:06,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:08,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:08,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 15:37:08,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:08,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:37:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:37:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:37:08,871 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 101 states. [2018-12-03 15:37:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:09,889 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-12-03 15:37:09,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:37:09,890 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 15:37:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:09,891 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:37:09,891 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 15:37:09,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:37:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 15:37:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 15:37:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 15:37:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2018-12-03 15:37:09,898 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 199 [2018-12-03 15:37:09,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:09,898 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2018-12-03 15:37:09,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:37:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2018-12-03 15:37:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 15:37:09,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:09,900 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 15:37:09,900 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:09,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:09,900 INFO L82 PathProgramCache]: Analyzing trace with hash -757086086, now seen corresponding path program 61 times [2018-12-03 15:37:09,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:09,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:09,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:09,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:09,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:37:10,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:10,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:10,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:10,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:10,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:10,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:10,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:10,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:12,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:14,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:14,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 15:37:14,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:37:14,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:37:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:37:14,169 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 102 states. [2018-12-03 15:37:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:15,051 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2018-12-03 15:37:15,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:37:15,051 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 15:37:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:15,052 INFO L225 Difference]: With dead ends: 206 [2018-12-03 15:37:15,052 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 15:37:15,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:37:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 15:37:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 15:37:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 15:37:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2018-12-03 15:37:15,059 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 201 [2018-12-03 15:37:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:15,059 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2018-12-03 15:37:15,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:37:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2018-12-03 15:37:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 15:37:15,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:15,060 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 15:37:15,060 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:15,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1710189149, now seen corresponding path program 62 times [2018-12-03 15:37:15,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:37:17,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:17,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:17,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:17,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:17,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:17,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:17,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:17,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 15:37:17,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:17,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:37:18,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:37:18,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:18,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 15:37:18,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:18,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:37:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:37:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:37:18,853 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2018-12-03 15:37:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:20,915 INFO L93 Difference]: Finished difference Result 2857 states and 4232 transitions. [2018-12-03 15:37:20,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:37:20,915 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 15:37:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:20,925 INFO L225 Difference]: With dead ends: 2857 [2018-12-03 15:37:20,925 INFO L226 Difference]: Without dead ends: 2855 [2018-12-03 15:37:20,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:37:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-03 15:37:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 206. [2018-12-03 15:37:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 15:37:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2018-12-03 15:37:21,023 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 203 [2018-12-03 15:37:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:21,024 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2018-12-03 15:37:21,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:37:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2018-12-03 15:37:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 15:37:21,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:21,025 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1] [2018-12-03 15:37:21,025 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:21,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1480768652, now seen corresponding path program 63 times [2018-12-03 15:37:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:21,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:21,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:37:22,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:37:22,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 15:37:22,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:37:22,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:37:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:37:22,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:37:22,250 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand 52 states. [2018-12-03 15:37:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:22,658 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-12-03 15:37:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:37:22,658 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 205 [2018-12-03 15:37:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:22,659 INFO L225 Difference]: With dead ends: 305 [2018-12-03 15:37:22,659 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:37:22,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:37:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:37:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:37:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:37:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:37:22,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2018-12-03 15:37:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:22,661 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:37:22,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:37:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:37:22,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:37:22,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:37:23,501 WARN L180 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2018-12-03 15:37:24,215 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 1827 DAG size of output: 400 [2018-12-03 15:37:30,913 WARN L180 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-12-03 15:37:32,716 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-12-03 15:37:32,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-12-03 15:37:32,721 INFO L444 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 15:37:32,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-12-03 15:37:32,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-12-03 15:37:32,722 INFO L444 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-12-03 15:37:32,723 INFO L444 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 15:37:32,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-12-03 15:37:32,756 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:37:32 BoogieIcfgContainer [2018-12-03 15:37:32,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:37:32,760 INFO L168 Benchmark]: Toolchain (without parser) took 149935.19 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -446.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:37:32,761 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:37:32,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:37:32,762 INFO L168 Benchmark]: Boogie Preprocessor took 25.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:37:32,762 INFO L168 Benchmark]: RCFGBuilder took 265.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:37:32,762 INFO L168 Benchmark]: TraceAbstraction took 149596.91 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -467.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:37:32,767 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 265.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149596.91 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -467.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 149.4s OverallTime, 65 OverallIterations, 101 TraceHistogramMax, 18.6s AutomataDifference, 0.0s DeadEndRemovalTime, 10.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 332 SDtfs, 1473 SDslu, 6250 SDs, 0 SdLazy, 9650 SolverSat, 2389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13456 GetRequests, 9202 SyntacticMatches, 1132 SemanticMatches, 3122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125668 ImplicationChecksByTransitivity, 110.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 65 MinimizatonAttempts, 2677 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 204 NumberOfFragments, 1406 HoareAnnotationTreeSize, 3 FomulaSimplifications, 26790 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 396 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 113.9s InterpolantComputationTime, 11890 NumberOfCodeBlocks, 11298 NumberOfCodeBlocksAsserted, 821 NumberOfCheckSat, 17540 ConstructedInterpolants, 0 QuantifiedInterpolants, 5655568 SizeOfPredicates, 53 NumberOfNonLiveVariables, 12902 ConjunctsInSsa, 2050 ConjunctsInUnsatCore, 191 InterpolantComputations, 4 PerfectInterpolantSequences, 262906/532273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...