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/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:36,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:36,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:36,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:36,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:36,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:36,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:36,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:36,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:36,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:36,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:36,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:36,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:36,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:36,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:36,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:36,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:36,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:36,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:36,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:36,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:36,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:36,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:36,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:36,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:36,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:36,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:36,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:36,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:36,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:36,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:36,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:36,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:36,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:36,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:36,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:36,647 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:21:36,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:36,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:36,675 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:36,676 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:36,676 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:36,676 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:36,676 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:36,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:36,677 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:36,677 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:36,677 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:36,677 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:36,677 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:36,680 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:36,680 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:36,681 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:36,681 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:36,681 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:36,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:36,681 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:36,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:36,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:36,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:36,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:36,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:36,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:36,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:36,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:36,685 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:36,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:36,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:36,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:36,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:36,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:36,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:36,687 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:36,687 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:36,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:36,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:36,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:36,688 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:36,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:36,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:36,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:36,766 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:36,767 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:36,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:21:36,768 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 15:21:36,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:36,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:36,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:36,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:36,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:36,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:36,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:36,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:36,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:36,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/1) ... [2018-12-03 15:21:36,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:36,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:36,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:36,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:36,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (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:21:36,947 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:36,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:36,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:37,190 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:37,191 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:37,191 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:37 BoogieIcfgContainer [2018-12-03 15:21:37,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:37,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:37,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:37,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:37,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:36" (1/2) ... [2018-12-03 15:21:37,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f64b97c and model type gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:37, skipping insertion in model container [2018-12-03 15:21:37,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:37" (2/2) ... [2018-12-03 15:21:37,200 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:21:37,210 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:37,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:37,238 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:37,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:37,281 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:37,282 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:37,282 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:37,282 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:37,282 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:37,284 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:37,284 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 15:21:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:21:37,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:37,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:21:37,320 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:37,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 928682, now seen corresponding path program 1 times [2018-12-03 15:21:37,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:37,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:37,529 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:21:37,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:37,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:21:37,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:37,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:37,551 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 15:21:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:37,666 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-12-03 15:21:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:37,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 15:21:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:37,689 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:21:37,689 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:21:37,696 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:21:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:21:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2018-12-03 15:21:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:21:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 15:21:37,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-12-03 15:21:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:37,754 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 15:21:37,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 15:21:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:21:37,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:37,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:21:37,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:37,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 930604, now seen corresponding path program 1 times [2018-12-03 15:21:37,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:37,805 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:21:37,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:37,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:21:37,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:37,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:21:37,809 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-03 15:21:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:37,888 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 15:21:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:37,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:21:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:37,891 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:37,891 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:21:37,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:21:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:21:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:21:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:21:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 15:21:37,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2018-12-03 15:21:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:37,896 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 15:21:37,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 15:21:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:21:37,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:37,897 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 15:21:37,897 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:37,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 487293020, now seen corresponding path program 1 times [2018-12-03 15:21:37,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:37,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:37,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:37,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:37,947 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:21:37,949 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [11], [13], [15] [2018-12-03 15:21:37,996 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:37,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:38,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:38,175 INFO L272 AbstractInterpreter]: Visited 6 different actions 19 times. Merged at 5 different actions 8 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:21:38,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:38,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:38,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,196 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:21:38,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:38,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:38,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:38,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:38,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:38,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:21:38,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:38,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:38,323 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-12-03 15:21:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:38,388 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-03 15:21:38,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:38,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 15:21:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:38,390 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:21:38,391 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:21:38,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:21:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:21:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-03 15:21:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:21:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 15:21:38,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-12-03 15:21:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:38,396 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 15:21:38,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 15:21:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:21:38,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:38,397 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2018-12-03 15:21:38,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:38,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1912214646, now seen corresponding path program 2 times [2018-12-03 15:21:38,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:21:38,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:38,495 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:38,495 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:21:38,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,495 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:21:38,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:38,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:38,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:21:38,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:38,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:21:38,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:21:38,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:38,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:21:38,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:38,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:21:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:21:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:38,914 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 8 states. [2018-12-03 15:21:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:39,205 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-03 15:21:39,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:21:39,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 15:21:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:39,209 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:21:39,210 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:21:39,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:21:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:21:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 15:21:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:21:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-03 15:21:39,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2018-12-03 15:21:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:39,217 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-03 15:21:39,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:21:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-12-03 15:21:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:21:39,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:39,219 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1] [2018-12-03 15:21:39,219 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:39,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 817531560, now seen corresponding path program 3 times [2018-12-03 15:21:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:39,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:39,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:39,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:39,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:39,344 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:21:39,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,344 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:21:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:39,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:39,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:39,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:39,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:39,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:39,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:39,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:21:39,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:39,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:21:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:21:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:39,490 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 6 states. [2018-12-03 15:21:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:39,580 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-03 15:21:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:21:39,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-03 15:21:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:39,582 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:21:39,583 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:21:39,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 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:21:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:21:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-03 15:21:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:21:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-03 15:21:39,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-12-03 15:21:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:39,590 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-03 15:21:39,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:21:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-12-03 15:21:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:21:39,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:39,591 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 1, 1, 1] [2018-12-03 15:21:39,591 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:39,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 348922690, now seen corresponding path program 4 times [2018-12-03 15:21:39,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:39,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:39,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:39,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:39,988 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:21:39,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,988 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:21:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:40,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:40,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:40,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:40,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:40,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:21:40,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:40,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:21:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:21:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:21:40,198 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 7 states. [2018-12-03 15:21:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:40,259 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-03 15:21:40,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:21:40,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-03 15:21:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:40,261 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:21:40,261 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:21:40,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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:21:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:21:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-03 15:21:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:21:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-03 15:21:40,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-12-03 15:21:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:40,268 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-03 15:21:40,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:21:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-12-03 15:21:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:21:40,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:40,269 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 3, 1, 1, 1] [2018-12-03 15:21:40,269 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:40,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 987364700, now seen corresponding path program 5 times [2018-12-03 15:21:40,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:40,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:40,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:40,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:40,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:40,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:40,375 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:21:40,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:40,376 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:21:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:40,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:40,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:21:40,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:40,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:21:40,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:21:40,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:40,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 15:21:40,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:40,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:21:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:21:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:40,667 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 14 states. [2018-12-03 15:21:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:41,052 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2018-12-03 15:21:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:21:41,054 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2018-12-03 15:21:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:41,055 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:21:41,055 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:21:41,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:21:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:21:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2018-12-03 15:21:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:21:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-03 15:21:41,065 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-12-03 15:21:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:41,065 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-03 15:21:41,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:21:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-12-03 15:21:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:21:41,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:41,067 INFO L402 BasicCegarLoop]: trace histogram [11, 6, 6, 1, 1, 1] [2018-12-03 15:21:41,067 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:41,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1932272702, now seen corresponding path program 6 times [2018-12-03 15:21:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 71 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:41,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:41,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:41,180 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:21:41,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,181 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:21:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:41,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:41,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:41,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:41,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 71 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:41,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 71 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:41,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:41,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:21:41,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:41,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:21:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:21:41,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:41,503 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 9 states. [2018-12-03 15:21:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:41,561 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-12-03 15:21:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:21:41,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-03 15:21:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:41,562 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:21:41,562 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:21:41,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 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:21:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:21:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-03 15:21:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:21:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-12-03 15:21:41,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 26 [2018-12-03 15:21:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:41,573 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-03 15:21:41,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:21:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-12-03 15:21:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:21:41,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:41,575 INFO L402 BasicCegarLoop]: trace histogram [12, 7, 6, 1, 1, 1] [2018-12-03 15:21:41,575 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:41,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 208381400, now seen corresponding path program 7 times [2018-12-03 15:21:41,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 82 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:41,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:41,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:41,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:21:41,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,795 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:21:41,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:41,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:41,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 82 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:41,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 82 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:42,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:42,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:21:42,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:42,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:21:42,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:21:42,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:21:42,082 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 10 states. [2018-12-03 15:21:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:42,126 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-12-03 15:21:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:21:42,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-03 15:21:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:42,127 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:21:42,127 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:21:42,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:21:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:21:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-03 15:21:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:21:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-12-03 15:21:42,136 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 28 [2018-12-03 15:21:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:42,136 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-12-03 15:21:42,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:21:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-12-03 15:21:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:21:42,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:42,138 INFO L402 BasicCegarLoop]: trace histogram [13, 8, 6, 1, 1, 1] [2018-12-03 15:21:42,138 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:42,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1406216434, now seen corresponding path program 8 times [2018-12-03 15:21:42,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:42,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:42,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 93 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:42,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:42,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:42,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:42,277 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:21:42,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:42,277 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:21:42,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:42,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:42,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:21:42,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:42,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 110 proven. 61 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:42,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 110 proven. 61 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-12-03 15:21:42,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:42,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:21:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:21:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:21:42,701 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 20 states. [2018-12-03 15:21:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:43,580 INFO L93 Difference]: Finished difference Result 88 states and 122 transitions. [2018-12-03 15:21:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:21:43,583 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-12-03 15:21:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:43,584 INFO L225 Difference]: With dead ends: 88 [2018-12-03 15:21:43,584 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:21:43,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:21:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:21:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 39. [2018-12-03 15:21:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:21:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-12-03 15:21:43,605 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 30 [2018-12-03 15:21:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:43,605 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-12-03 15:21:43,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:21:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-12-03 15:21:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:21:43,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:43,608 INFO L402 BasicCegarLoop]: trace histogram [17, 9, 9, 1, 1, 1] [2018-12-03 15:21:43,609 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:43,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1767665748, now seen corresponding path program 9 times [2018-12-03 15:21:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:43,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:43,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 161 proven. 81 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:43,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:43,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:43,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:43,893 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:21:43,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:43,893 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:21:43,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:43,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:43,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:43,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:43,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 77 proven. 225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:44,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 77 proven. 225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:44,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:44,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 33 [2018-12-03 15:21:44,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:44,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:21:44,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:21:44,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:21:44,929 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 18 states. [2018-12-03 15:21:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:45,302 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2018-12-03 15:21:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:21:45,303 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-12-03 15:21:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:45,303 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:21:45,304 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:21:45,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:21:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:21:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-03 15:21:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:21:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-12-03 15:21:45,322 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 38 [2018-12-03 15:21:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:45,323 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-12-03 15:21:45,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:21:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-12-03 15:21:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:21:45,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:45,324 INFO L402 BasicCegarLoop]: trace histogram [24, 16, 9, 1, 1, 1] [2018-12-03 15:21:45,325 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:45,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1407949322, now seen corresponding path program 10 times [2018-12-03 15:21:45,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 280 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:45,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:45,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:45,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:45,768 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:21:45,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:45,768 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:21:45,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:45,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:45,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 280 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:45,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 280 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:46,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:21:46,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:46,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:21:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:21:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:21:46,475 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 19 states. [2018-12-03 15:21:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:46,612 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-12-03 15:21:46,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:21:46,613 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-12-03 15:21:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:46,614 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:21:46,614 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:21:46,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 86 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:21:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:21:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-03 15:21:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:21:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-03 15:21:46,637 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 52 [2018-12-03 15:21:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:46,637 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-03 15:21:46,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:21:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-03 15:21:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:21:46,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:46,639 INFO L402 BasicCegarLoop]: trace histogram [25, 17, 9, 1, 1, 1] [2018-12-03 15:21:46,640 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:46,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:46,642 INFO L82 PathProgramCache]: Analyzing trace with hash 547352356, now seen corresponding path program 11 times [2018-12-03 15:21:46,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:46,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:46,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 297 proven. 289 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:46,941 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:46,941 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:21:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,941 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:21:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:46,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:46,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:21:46,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:46,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 488 proven. 145 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 15:21:47,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 488 proven. 145 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 15:21:48,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:48,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 45 [2018-12-03 15:21:48,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:48,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:21:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:21:48,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1503, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:48,062 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 38 states. [2018-12-03 15:21:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:49,709 INFO L93 Difference]: Finished difference Result 250 states and 359 transitions. [2018-12-03 15:21:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:21:49,710 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2018-12-03 15:21:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:49,711 INFO L225 Difference]: With dead ends: 250 [2018-12-03 15:21:49,711 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 15:21:49,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1633, Invalid=4847, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:21:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 15:21:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 75. [2018-12-03 15:21:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:21:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2018-12-03 15:21:49,758 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 54 [2018-12-03 15:21:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:49,758 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-12-03 15:21:49,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:21:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2018-12-03 15:21:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:21:49,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:49,760 INFO L402 BasicCegarLoop]: trace histogram [35, 18, 18, 1, 1, 1] [2018-12-03 15:21:49,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:49,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash -89537642, now seen corresponding path program 12 times [2018-12-03 15:21:49,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:49,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:49,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 647 proven. 324 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:50,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:50,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:50,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:50,008 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:21:50,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:50,009 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:21:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:50,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:50,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:50,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:50,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 283 proven. 961 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:50,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 283 proven. 961 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:52,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:52,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 33, 33] total 51 [2018-12-03 15:21:52,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:52,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:21:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:21:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:52,130 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand 34 states. [2018-12-03 15:21:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:52,475 INFO L93 Difference]: Finished difference Result 143 states and 193 transitions. [2018-12-03 15:21:52,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:21:52,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-12-03 15:21:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:52,477 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:21:52,477 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:21:52,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 102 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:21:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-03 15:21:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:21:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2018-12-03 15:21:52,513 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 74 [2018-12-03 15:21:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:52,514 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2018-12-03 15:21:52,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:21:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2018-12-03 15:21:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:21:52,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:52,515 INFO L402 BasicCegarLoop]: trace histogram [49, 32, 18, 1, 1, 1] [2018-12-03 15:21:52,516 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:52,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash 962779778, now seen corresponding path program 13 times [2018-12-03 15:21:52,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1137 proven. 1024 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:53,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:53,356 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:53,356 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:21:53,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,357 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:21:53,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:53,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:53,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1137 proven. 1024 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:53,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1137 proven. 1024 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:54,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:54,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 51 [2018-12-03 15:21:54,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:54,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:21:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:21:54,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:54,362 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 35 states. [2018-12-03 15:21:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:54,498 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2018-12-03 15:21:54,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:21:54,498 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 102 [2018-12-03 15:21:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:54,499 INFO L225 Difference]: With dead ends: 145 [2018-12-03 15:21:54,499 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:21:54,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 170 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:21:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-03 15:21:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:21:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2018-12-03 15:21:54,540 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 102 [2018-12-03 15:21:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:54,540 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2018-12-03 15:21:54,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:21:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2018-12-03 15:21:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:21:54,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:54,543 INFO L402 BasicCegarLoop]: trace histogram [50, 33, 18, 1, 1, 1] [2018-12-03 15:21:54,544 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:54,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash -31918820, now seen corresponding path program 14 times [2018-12-03 15:21:54,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1172 proven. 1089 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:55,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:55,254 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:55,254 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:21:55,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,254 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:21:55,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:55,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:55,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 15:21:55,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:55,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1172 proven. 1089 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:55,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1172 proven. 1089 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:56,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:56,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 15:21:56,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:56,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:21:56,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:21:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:56,334 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 36 states. [2018-12-03 15:21:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:56,503 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2018-12-03 15:21:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:21:56,504 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 104 [2018-12-03 15:21:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:56,504 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:21:56,504 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:21:56,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 173 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:21:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-03 15:21:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:21:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-12-03 15:21:56,542 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 104 [2018-12-03 15:21:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:56,543 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-12-03 15:21:56,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:21:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-12-03 15:21:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:21:56,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,544 INFO L402 BasicCegarLoop]: trace histogram [51, 34, 18, 1, 1, 1] [2018-12-03 15:21:56,544 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1840435510, now seen corresponding path program 15 times [2018-12-03 15:21:56,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1207 proven. 1156 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:57,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:57,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:57,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:21:57,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,360 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:21:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:57,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:57,425 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:57,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:57,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1207 proven. 1156 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:57,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1207 proven. 1156 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:58,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 15:21:58,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:21:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:21:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:58,412 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 37 states. [2018-12-03 15:21:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:58,643 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2018-12-03 15:21:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:21:58,645 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2018-12-03 15:21:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:58,647 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:21:58,647 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:21:58,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 176 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:21:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:21:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-12-03 15:21:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:21:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2018-12-03 15:21:58,681 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 106 [2018-12-03 15:21:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:58,682 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2018-12-03 15:21:58,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:21:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2018-12-03 15:21:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:21:58,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:58,683 INFO L402 BasicCegarLoop]: trace histogram [52, 35, 18, 1, 1, 1] [2018-12-03 15:21:58,683 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:58,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1581649616, now seen corresponding path program 16 times [2018-12-03 15:21:58,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 1242 proven. 1225 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:59,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,431 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:21:59,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,431 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:21:59,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:59,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 1242 proven. 1225 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:21:59,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 1242 proven. 1225 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 51 [2018-12-03 15:22:00,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:22:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:22:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:00,766 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 38 states. [2018-12-03 15:22:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,941 INFO L93 Difference]: Finished difference Result 151 states and 188 transitions. [2018-12-03 15:22:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:22:00,941 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 108 [2018-12-03 15:22:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,942 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:22:00,942 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:22:00,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:22:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-12-03 15:22:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:22:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2018-12-03 15:22:00,975 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 108 [2018-12-03 15:22:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,976 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2018-12-03 15:22:00,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:22:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2018-12-03 15:22:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:22:00,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,977 INFO L402 BasicCegarLoop]: trace histogram [53, 36, 18, 1, 1, 1] [2018-12-03 15:22:00,977 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1996508650, now seen corresponding path program 17 times [2018-12-03 15:22:00,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 1277 proven. 1296 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:01,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:01,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:01,765 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:22:01,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,765 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:22:01,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:01,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:01,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 15:22:01,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:01,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 2214 proven. 613 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 15:22:02,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 2214 proven. 613 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 15:22:04,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:04,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 93 [2018-12-03 15:22:04,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:04,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:22:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:22:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2336, Invalid=6406, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:22:04,154 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 76 states. [2018-12-03 15:22:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:07,269 INFO L93 Difference]: Finished difference Result 856 states and 1254 transitions. [2018-12-03 15:22:07,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 15:22:07,270 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 110 [2018-12-03 15:22:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:07,274 INFO L225 Difference]: With dead ends: 856 [2018-12-03 15:22:07,274 INFO L226 Difference]: Without dead ends: 817 [2018-12-03 15:22:07,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 128 SyntacticMatches, 36 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9361 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6678, Invalid=21044, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:22:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-12-03 15:22:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 151. [2018-12-03 15:22:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:22:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2018-12-03 15:22:07,399 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 110 [2018-12-03 15:22:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:07,400 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2018-12-03 15:22:07,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:22:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2018-12-03 15:22:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:22:07,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:07,401 INFO L402 BasicCegarLoop]: trace histogram [73, 37, 37, 1, 1, 1] [2018-12-03 15:22:07,401 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:07,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash 366608588, now seen corresponding path program 18 times [2018-12-03 15:22:07,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:07,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:07,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:07,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:07,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 2737 proven. 1369 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:08,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:08,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:08,369 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:22:08,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,369 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:22:08,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:08,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:08,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:08,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:08,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 2737 proven. 1369 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:08,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 2737 proven. 1369 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:10,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:10,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 15:22:10,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:10,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:22:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:22:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:10,810 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand 40 states. [2018-12-03 15:22:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:11,084 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2018-12-03 15:22:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:22:11,085 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 150 [2018-12-03 15:22:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:11,086 INFO L225 Difference]: With dead ends: 231 [2018-12-03 15:22:11,087 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:22:11,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 261 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:22:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-12-03 15:22:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:22:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2018-12-03 15:22:11,207 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 150 [2018-12-03 15:22:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:11,208 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2018-12-03 15:22:11,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:22:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2018-12-03 15:22:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:22:11,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:11,209 INFO L402 BasicCegarLoop]: trace histogram [74, 38, 37, 1, 1, 1] [2018-12-03 15:22:11,209 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:11,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash 150650726, now seen corresponding path program 19 times [2018-12-03 15:22:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:11,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:11,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 2810 proven. 1444 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:12,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:12,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:12,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:12,439 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:22:12,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:12,439 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:22:12,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:12,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 2810 proven. 1444 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:12,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 2810 proven. 1444 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:13,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:13,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 51 [2018-12-03 15:22:13,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:13,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:22:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:22:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:13,544 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand 41 states. [2018-12-03 15:22:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,840 INFO L93 Difference]: Finished difference Result 233 states and 308 transitions. [2018-12-03 15:22:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:22:13,841 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 152 [2018-12-03 15:22:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,842 INFO L225 Difference]: With dead ends: 233 [2018-12-03 15:22:13,842 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 15:22:13,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 264 SyntacticMatches, 28 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 15:22:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-12-03 15:22:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 15:22:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2018-12-03 15:22:13,953 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 152 [2018-12-03 15:22:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,954 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2018-12-03 15:22:13,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:22:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2018-12-03 15:22:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 15:22:13,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,955 INFO L402 BasicCegarLoop]: trace histogram [75, 39, 37, 1, 1, 1] [2018-12-03 15:22:13,955 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1226424448, now seen corresponding path program 20 times [2018-12-03 15:22:13,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2883 proven. 1521 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2018-12-03 15:22:14,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:14,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:14,899 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:22:14,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,899 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:22:14,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:14,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:15,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-12-03 15:22:15,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:15,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2962 proven. 2665 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-03 15:22:16,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2962 proven. 2665 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-03 15:22:19,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:19,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 83 [2018-12-03 15:22:19,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:19,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:22:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:22:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1806, Invalid=5166, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:22:19,057 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand 82 states. [2018-12-03 15:22:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:22,601 INFO L93 Difference]: Finished difference Result 460 states and 649 transitions. [2018-12-03 15:22:22,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 15:22:22,603 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 154 [2018-12-03 15:22:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:22,605 INFO L225 Difference]: With dead ends: 460 [2018-12-03 15:22:22,605 INFO L226 Difference]: Without dead ends: 383 [2018-12-03 15:22:22,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 191 SyntacticMatches, 74 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10683 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5478, Invalid=20928, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 15:22:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-12-03 15:22:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 163. [2018-12-03 15:22:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:22:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 203 transitions. [2018-12-03 15:22:22,771 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 203 transitions. Word has length 154 [2018-12-03 15:22:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:22,772 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 203 transitions. [2018-12-03 15:22:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:22:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions. [2018-12-03 15:22:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:22:22,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:22,772 INFO L402 BasicCegarLoop]: trace histogram [79, 40, 40, 1, 1, 1] [2018-12-03 15:22:22,773 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:22,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1018618210, now seen corresponding path program 21 times [2018-12-03 15:22:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 3199 proven. 1600 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:23,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:23,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:23,508 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:22:23,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,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 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:22:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:23,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:23,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:23,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:23,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 3199 proven. 1600 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:23,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 3199 proven. 1600 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:24,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:24,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 15:22:24,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:24,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:22:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:22:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:24,885 INFO L87 Difference]: Start difference. First operand 163 states and 203 transitions. Second operand 43 states. [2018-12-03 15:22:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:25,840 INFO L93 Difference]: Finished difference Result 249 states and 330 transitions. [2018-12-03 15:22:25,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:22:25,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2018-12-03 15:22:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:25,842 INFO L225 Difference]: With dead ends: 249 [2018-12-03 15:22:25,842 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:22:25,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 282 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:22:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-12-03 15:22:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:22:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 205 transitions. [2018-12-03 15:22:26,112 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 205 transitions. Word has length 162 [2018-12-03 15:22:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:26,112 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 205 transitions. [2018-12-03 15:22:26,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:22:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2018-12-03 15:22:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:22:26,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:26,113 INFO L402 BasicCegarLoop]: trace histogram [80, 41, 40, 1, 1, 1] [2018-12-03 15:22:26,114 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:26,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash 964462844, now seen corresponding path program 22 times [2018-12-03 15:22:26,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:26,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:26,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3278 proven. 1681 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:27,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:27,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:27,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:27,455 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:22:27,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:27,455 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:22:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:27,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:27,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3278 proven. 1681 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:27,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3278 proven. 1681 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:28,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 51 [2018-12-03 15:22:28,531 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:28,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:22:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:22:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:28,532 INFO L87 Difference]: Start difference. First operand 165 states and 205 transitions. Second operand 44 states. [2018-12-03 15:22:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:28,854 INFO L93 Difference]: Finished difference Result 251 states and 332 transitions. [2018-12-03 15:22:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:22:28,854 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 164 [2018-12-03 15:22:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:28,856 INFO L225 Difference]: With dead ends: 251 [2018-12-03 15:22:28,856 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 15:22:28,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 285 SyntacticMatches, 34 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 15:22:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-12-03 15:22:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 15:22:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 207 transitions. [2018-12-03 15:22:29,014 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 207 transitions. Word has length 164 [2018-12-03 15:22:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:29,014 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 207 transitions. [2018-12-03 15:22:29,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:22:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2018-12-03 15:22:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 15:22:29,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:29,015 INFO L402 BasicCegarLoop]: trace histogram [81, 42, 40, 1, 1, 1] [2018-12-03 15:22:29,016 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:29,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash 460763670, now seen corresponding path program 23 times [2018-12-03 15:22:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:29,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:29,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 3357 proven. 1764 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2018-12-03 15:22:30,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:30,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:30,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:30,000 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:22:30,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:30,000 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:22:30,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:30,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:30,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-12-03 15:22:30,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:30,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 3442 proven. 3121 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-03 15:22:31,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 3442 proven. 3121 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-03 15:22:34,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:34,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 89 [2018-12-03 15:22:34,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:34,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:22:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:22:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2070, Invalid=5940, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:22:34,429 INFO L87 Difference]: Start difference. First operand 167 states and 207 transitions. Second operand 88 states. [2018-12-03 15:22:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:38,197 INFO L93 Difference]: Finished difference Result 496 states and 700 transitions. [2018-12-03 15:22:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 15:22:38,198 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 166 [2018-12-03 15:22:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:38,200 INFO L225 Difference]: With dead ends: 496 [2018-12-03 15:22:38,200 INFO L226 Difference]: Without dead ends: 413 [2018-12-03 15:22:38,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 206 SyntacticMatches, 80 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12387 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6276, Invalid=24174, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:22:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-03 15:22:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 175. [2018-12-03 15:22:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:22:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 218 transitions. [2018-12-03 15:22:38,418 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 218 transitions. Word has length 166 [2018-12-03 15:22:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:38,418 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 218 transitions. [2018-12-03 15:22:38,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:22:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2018-12-03 15:22:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:22:38,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:38,419 INFO L402 BasicCegarLoop]: trace histogram [85, 43, 43, 1, 1, 1] [2018-12-03 15:22:38,419 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:38,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash -303680392, now seen corresponding path program 24 times [2018-12-03 15:22:38,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:38,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:38,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 3697 proven. 1849 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:39,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:39,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:39,271 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:22:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:39,271 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:22:39,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:39,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:39,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:39,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:39,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 3697 proven. 1849 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:39,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 3697 proven. 1849 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:40,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 15:22:40,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:40,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:22:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:22:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:40,583 INFO L87 Difference]: Start difference. First operand 175 states and 218 transitions. Second operand 46 states. [2018-12-03 15:22:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:41,144 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2018-12-03 15:22:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:22:41,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 174 [2018-12-03 15:22:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:41,146 INFO L225 Difference]: With dead ends: 267 [2018-12-03 15:22:41,146 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:22:41,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 303 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:22:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-03 15:22:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:22:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 220 transitions. [2018-12-03 15:22:41,374 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 220 transitions. Word has length 174 [2018-12-03 15:22:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:41,374 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 220 transitions. [2018-12-03 15:22:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:22:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 220 transitions. [2018-12-03 15:22:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 15:22:41,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:41,375 INFO L402 BasicCegarLoop]: trace histogram [86, 44, 43, 1, 1, 1] [2018-12-03 15:22:41,376 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:41,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash -549763822, now seen corresponding path program 25 times [2018-12-03 15:22:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:41,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:41,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 3782 proven. 1936 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:42,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:42,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:42,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:42,427 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:22:42,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:42,428 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:22:42,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:42,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:42,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 3782 proven. 1936 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:42,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 3782 proven. 1936 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:43,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:43,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 51 [2018-12-03 15:22:43,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:43,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:22:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:22:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:43,504 INFO L87 Difference]: Start difference. First operand 177 states and 220 transitions. Second operand 47 states. [2018-12-03 15:22:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:43,900 INFO L93 Difference]: Finished difference Result 269 states and 356 transitions. [2018-12-03 15:22:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:22:43,901 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 176 [2018-12-03 15:22:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:43,902 INFO L225 Difference]: With dead ends: 269 [2018-12-03 15:22:43,902 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 15:22:43,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 306 SyntacticMatches, 40 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 15:22:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-12-03 15:22:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 15:22:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2018-12-03 15:22:44,105 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 176 [2018-12-03 15:22:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:44,106 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2018-12-03 15:22:44,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:22:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2018-12-03 15:22:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 15:22:44,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:44,107 INFO L402 BasicCegarLoop]: trace histogram [87, 45, 43, 1, 1, 1] [2018-12-03 15:22:44,107 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:44,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -812738772, now seen corresponding path program 26 times [2018-12-03 15:22:44,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:44,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 3867 proven. 2025 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-12-03 15:22:45,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:45,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:45,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:45,236 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:22:45,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:45,236 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:22:45,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:45,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:45,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-12-03 15:22:45,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:45,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 3958 proven. 3613 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-03 15:22:48,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 3958 proven. 3613 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-03 15:22:51,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:51,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2018-12-03 15:22:51,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:51,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:22:51,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:22:51,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=6768, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:22:51,947 INFO L87 Difference]: Start difference. First operand 179 states and 222 transitions. Second operand 94 states. [2018-12-03 15:22:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:55,694 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2018-12-03 15:22:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-03 15:22:55,695 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 178 [2018-12-03 15:22:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:55,697 INFO L225 Difference]: With dead ends: 532 [2018-12-03 15:22:55,697 INFO L226 Difference]: Without dead ends: 443 [2018-12-03 15:22:55,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 221 SyntacticMatches, 86 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14217 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7128, Invalid=27654, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 15:22:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-03 15:22:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 187. [2018-12-03 15:22:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 15:22:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2018-12-03 15:22:55,976 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 178 [2018-12-03 15:22:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:55,976 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2018-12-03 15:22:55,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:22:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2018-12-03 15:22:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 15:22:55,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:55,977 INFO L402 BasicCegarLoop]: trace histogram [91, 46, 46, 1, 1, 1] [2018-12-03 15:22:55,977 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:55,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash 245864974, now seen corresponding path program 27 times [2018-12-03 15:22:55,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:55,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:55,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4231 proven. 2116 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:22:57,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:57,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:57,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:57,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:22:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:57,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 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:22:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:57,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:57,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:57,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:57,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4231 proven. 2116 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:22:57,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4231 proven. 2116 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:22:58,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:58,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 15:22:58,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:58,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:22:58,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:22:58,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:58,265 INFO L87 Difference]: Start difference. First operand 187 states and 233 transitions. Second operand 49 states. [2018-12-03 15:22:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:58,692 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2018-12-03 15:22:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:22:58,693 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 186 [2018-12-03 15:22:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:58,694 INFO L225 Difference]: With dead ends: 285 [2018-12-03 15:22:58,694 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 15:22:58,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 324 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:22:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 15:22:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-12-03 15:22:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:22:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 235 transitions. [2018-12-03 15:22:58,996 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 235 transitions. Word has length 186 [2018-12-03 15:22:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:58,996 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 235 transitions. [2018-12-03 15:22:58,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:22:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 235 transitions. [2018-12-03 15:22:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 15:22:58,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:58,997 INFO L402 BasicCegarLoop]: trace histogram [92, 47, 46, 1, 1, 1] [2018-12-03 15:22:58,997 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:58,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1404474280, now seen corresponding path program 28 times [2018-12-03 15:22:58,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:58,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:58,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:58,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 4322 proven. 2209 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:22:59,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:59,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:59,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:00,000 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:23:00,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:00,000 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:23:00,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:00,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:00,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 4322 proven. 2209 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:23:00,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 4322 proven. 2209 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:23:01,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:01,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2018-12-03 15:23:01,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:01,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:23:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:23:01,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:01,216 INFO L87 Difference]: Start difference. First operand 189 states and 235 transitions. Second operand 50 states. [2018-12-03 15:23:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:01,712 INFO L93 Difference]: Finished difference Result 287 states and 380 transitions. [2018-12-03 15:23:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:23:01,713 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 188 [2018-12-03 15:23:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:01,714 INFO L225 Difference]: With dead ends: 287 [2018-12-03 15:23:01,715 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 15:23:01,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 327 SyntacticMatches, 46 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 15:23:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-12-03 15:23:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 15:23:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2018-12-03 15:23:02,161 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 188 [2018-12-03 15:23:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:02,161 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2018-12-03 15:23:02,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:23:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2018-12-03 15:23:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 15:23:02,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:02,162 INFO L402 BasicCegarLoop]: trace histogram [93, 48, 46, 1, 1, 1] [2018-12-03 15:23:02,163 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:02,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:02,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1863479614, now seen corresponding path program 29 times [2018-12-03 15:23:02,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:02,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:02,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 4413 proven. 2304 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-12-03 15:23:03,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:03,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:03,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:03,179 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:23:03,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:03,179 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:23:03,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:03,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:03,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-12-03 15:23:03,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:03,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 4510 proven. 4141 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 15:23:05,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 4510 proven. 4141 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 15:23:08,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:08,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 101 [2018-12-03 15:23:08,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:08,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:23:08,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:23:08,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2652, Invalid=7650, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:08,799 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand 100 states. [2018-12-03 15:23:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:13,396 INFO L93 Difference]: Finished difference Result 568 states and 802 transitions. [2018-12-03 15:23:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-12-03 15:23:13,396 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 190 [2018-12-03 15:23:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:13,398 INFO L225 Difference]: With dead ends: 568 [2018-12-03 15:23:13,398 INFO L226 Difference]: Without dead ends: 473 [2018-12-03 15:23:13,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 236 SyntacticMatches, 92 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16173 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=8034, Invalid=31368, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:23:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-12-03 15:23:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 199. [2018-12-03 15:23:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 15:23:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2018-12-03 15:23:13,765 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 190 [2018-12-03 15:23:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:13,766 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2018-12-03 15:23:13,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:23:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2018-12-03 15:23:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 15:23:13,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:13,767 INFO L402 BasicCegarLoop]: trace histogram [97, 49, 49, 1, 1, 1] [2018-12-03 15:23:13,767 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:13,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash -624774620, now seen corresponding path program 30 times [2018-12-03 15:23:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:13,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:13,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 4801 proven. 2401 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2018-12-03 15:23:15,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:15,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:15,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:15,894 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:23:15,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:15,894 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:23:15,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:15,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:15,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:15,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:15,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 4801 proven. 2401 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2018-12-03 15:23:16,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 4801 proven. 2401 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2018-12-03 15:23:17,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 15:23:17,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:17,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:23:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:23:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:17,296 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand 52 states. [2018-12-03 15:23:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:17,999 INFO L93 Difference]: Finished difference Result 349 states and 448 transitions. [2018-12-03 15:23:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:23:17,999 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 198 [2018-12-03 15:23:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:18,001 INFO L225 Difference]: With dead ends: 349 [2018-12-03 15:23:18,001 INFO L226 Difference]: Without dead ends: 248 [2018-12-03 15:23:18,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 345 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-03 15:23:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 201. [2018-12-03 15:23:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 15:23:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2018-12-03 15:23:18,352 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 198 [2018-12-03 15:23:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2018-12-03 15:23:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:23:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2018-12-03 15:23:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 15:23:18,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:18,354 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 49, 1, 1, 1] [2018-12-03 15:23:18,354 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:18,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -420080450, now seen corresponding path program 31 times [2018-12-03 15:23:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:18,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:18,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 4900 proven. 4705 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 15:23:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:19,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:19,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:19,854 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:23:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:19,854 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:23:19,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:19,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:19,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 4900 proven. 4705 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 15:23:20,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 4900 proven. 4705 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-03 15:23:22,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:22,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 53 [2018-12-03 15:23:22,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:22,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:23:22,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:23:22,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:23:22,447 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand 53 states. [2018-12-03 15:23:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:23,785 INFO L93 Difference]: Finished difference Result 401 states and 549 transitions. [2018-12-03 15:23:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:23:23,785 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 200 [2018-12-03 15:23:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:23,789 INFO L225 Difference]: With dead ends: 401 [2018-12-03 15:23:23,789 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 15:23:23,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 349 SyntacticMatches, 98 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2599 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:23:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 15:23:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 205. [2018-12-03 15:23:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 15:23:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2018-12-03 15:23:24,298 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 200 [2018-12-03 15:23:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:24,298 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2018-12-03 15:23:24,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:23:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2018-12-03 15:23:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 15:23:24,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:24,300 INFO L402 BasicCegarLoop]: trace histogram [100, 51, 50, 1, 1, 1] [2018-12-03 15:23:24,300 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:24,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1557903122, now seen corresponding path program 32 times [2018-12-03 15:23:24,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:24,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:24,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:24,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:24,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 5098 proven. 2601 refuted. 0 times theorem prover too weak. 2401 trivial. 0 not checked. [2018-12-03 15:23:26,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:26,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:26,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:26,652 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:23:26,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:26,652 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:23:26,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:26,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:26,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 101 check-sat command(s) [2018-12-03 15:23:26,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:26,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:29,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:33,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:33,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 103, 103] total 104 [2018-12-03 15:23:33,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:33,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:23:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:23:33,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=9231, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:23:33,413 INFO L87 Difference]: Start difference. First operand 205 states and 256 transitions. Second operand 104 states. [2018-12-03 15:23:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:49,946 INFO L93 Difference]: Finished difference Result 3007 states and 4385 transitions. [2018-12-03 15:23:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:23:49,946 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-12-03 15:23:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:49,959 INFO L225 Difference]: With dead ends: 3007 [2018-12-03 15:23:49,959 INFO L226 Difference]: Without dead ends: 2902 [2018-12-03 15:23:49,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 307 SyntacticMatches, 52 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1481, Invalid=9231, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:23:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-12-03 15:23:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2804. [2018-12-03 15:23:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2018-12-03 15:23:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 2904 transitions. [2018-12-03 15:23:59,963 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 2904 transitions. Word has length 204 [2018-12-03 15:23:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:59,964 INFO L480 AbstractCegarLoop]: Abstraction has 2804 states and 2904 transitions. [2018-12-03 15:23:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:23:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 2904 transitions. [2018-12-03 15:23:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 15:23:59,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:59,966 INFO L402 BasicCegarLoop]: trace histogram [101, 52, 50, 1, 1, 1] [2018-12-03 15:23:59,966 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:59,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1798736390, now seen corresponding path program 33 times [2018-12-03 15:23:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:59,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:59,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 5302 proven. 4901 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-03 15:24:02,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:02,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:02,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:02,150 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:24:02,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:02,150 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:24:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:02,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:02,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:02,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:02,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 5302 proven. 4901 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-03 15:24:02,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 5302 proven. 4901 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-03 15:24:04,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:04,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 15:24:04,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:04,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:24:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:24:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:24:04,704 INFO L87 Difference]: Start difference. First operand 2804 states and 2904 transitions. Second operand 54 states. [2018-12-03 15:24:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:15,449 INFO L93 Difference]: Finished difference Result 5611 states and 5812 transitions. [2018-12-03 15:24:15,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:24:15,449 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 206 [2018-12-03 15:24:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:15,459 INFO L225 Difference]: With dead ends: 5611 [2018-12-03 15:24:15,460 INFO L226 Difference]: Without dead ends: 2806 [2018-12-03 15:24:15,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 359 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:24:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2018-12-03 15:24:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2806. [2018-12-03 15:24:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-12-03 15:24:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 2906 transitions. [2018-12-03 15:24:24,853 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 2906 transitions. Word has length 206 [2018-12-03 15:24:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:24,853 INFO L480 AbstractCegarLoop]: Abstraction has 2806 states and 2906 transitions. [2018-12-03 15:24:24,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:24:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 2906 transitions. [2018-12-03 15:24:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 15:24:24,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:24,854 INFO L402 BasicCegarLoop]: trace histogram [102, 52, 51, 1, 1, 1] [2018-12-03 15:24:24,855 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:24,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash -132992352, now seen corresponding path program 34 times [2018-12-03 15:24:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:24,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:24,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:24,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 7802 proven. 0 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2018-12-03 15:24:26,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:24:26,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 15:24:26,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:24:26,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:24:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:24:26,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:24:26,209 INFO L87 Difference]: Start difference. First operand 2806 states and 2906 transitions. Second operand 53 states. [2018-12-03 15:24:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:26,468 INFO L93 Difference]: Finished difference Result 2806 states and 2906 transitions. [2018-12-03 15:24:26,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:24:26,468 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-12-03 15:24:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:26,468 INFO L225 Difference]: With dead ends: 2806 [2018-12-03 15:24:26,468 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:24:26,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:24:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:24:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:24:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:24:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:24:26,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 208 [2018-12-03 15:24:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:26,473 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:24:26,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:24:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:24:26,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:24:26,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:24:29,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:30,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:31,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:32,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:33,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:34,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:34,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:34,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:39,970 WARN L180 SmtUtils]: Spent 13.47 s on a formula simplification. DAG size of input: 2205 DAG size of output: 1276 [2018-12-03 15:24:47,776 WARN L180 SmtUtils]: Spent 7.80 s on a formula simplification. DAG size of input: 2041 DAG size of output: 1440 [2018-12-03 15:25:14,940 WARN L180 SmtUtils]: Spent 27.15 s on a formula simplification. DAG size of input: 1266 DAG size of output: 511 [2018-12-03 15:25:48,908 WARN L180 SmtUtils]: Spent 33.96 s on a formula simplification. DAG size of input: 1411 DAG size of output: 509 [2018-12-03 15:25:48,914 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 55) no Hoare annotation was computed. [2018-12-03 15:25:48,914 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 55) no Hoare annotation was computed. [2018-12-03 15:25:48,914 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 55) no Hoare annotation was computed. [2018-12-03 15:25:48,916 INFO L444 ceAbstractionStarter]: At program point L52(lines 20 52) the Hoare annotation is: (let ((.cse20 (<= 49 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 49)) (.cse14 (<= ULTIMATE.start_main_~y~4 36)) (.cse15 (<= 36 ULTIMATE.start_main_~y~4)) (.cse12 (<= 47 ULTIMATE.start_main_~y~4)) (.cse13 (<= ULTIMATE.start_main_~y~4 47)) (.cse38 (<= 33 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 33)) (.cse42 (<= ULTIMATE.start_main_~y~4 44)) (.cse43 (<= 44 ULTIMATE.start_main_~y~4)) (.cse0 (<= 32 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 32)) (.cse35 (<= ULTIMATE.start_main_~y~4 15)) (.cse34 (<= 15 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 2)) (.cse26 (<= 2 ULTIMATE.start_main_~y~4)) (.cse6 (<= 5 ULTIMATE.start_main_~y~4)) (.cse7 (<= ULTIMATE.start_main_~y~4 5)) (.cse18 (<= ULTIMATE.start_main_~y~4 26)) (.cse19 (<= 26 ULTIMATE.start_main_~y~4)) (.cse53 (<= ULTIMATE.start_main_~y~4 18)) (.cse52 (<= 18 ULTIMATE.start_main_~y~4)) (.cse68 (<= 45 ULTIMATE.start_main_~y~4)) (.cse69 (<= ULTIMATE.start_main_~y~4 45)) (.cse25 (<= ULTIMATE.start_main_~y~4 40)) (.cse24 (<= 40 ULTIMATE.start_main_~y~4)) (.cse40 (<= ULTIMATE.start_main_~y~4 0)) (.cse41 (<= 0 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 12)) (.cse4 (<= 12 ULTIMATE.start_main_~y~4)) (.cse16 (<= 17 ULTIMATE.start_main_~y~4)) (.cse17 (<= ULTIMATE.start_main_~y~4 17)) (.cse81 (<= 9 ULTIMATE.start_main_~y~4)) (.cse80 (<= ULTIMATE.start_main_~y~4 9)) (.cse71 (<= ULTIMATE.start_main_~y~4 42)) (.cse70 (<= 42 ULTIMATE.start_main_~y~4)) (.cse78 (<= 25 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 25)) (.cse3 (<= 48 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 48)) (.cse23 (<= 46 ULTIMATE.start_main_~y~4)) (.cse22 (<= ULTIMATE.start_main_~y~4 46)) (.cse64 (<= 8 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 8)) (.cse72 (<= 4 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 4)) (.cse49 (<= 6 ULTIMATE.start_main_~y~4)) (.cse48 (<= ULTIMATE.start_main_~y~4 6)) (.cse54 (<= 35 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 35)) (.cse29 (<= ULTIMATE.start_main_~y~4 16)) (.cse28 (<= 16 ULTIMATE.start_main_~y~4)) (.cse66 (<= ULTIMATE.start_main_~y~4 13)) (.cse67 (<= 13 ULTIMATE.start_main_~y~4)) (.cse95 (<= 3 ULTIMATE.start_main_~y~4)) (.cse94 (<= ULTIMATE.start_main_~y~4 3)) (.cse92 (<= 14 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 14)) (.cse62 (<= ULTIMATE.start_main_~y~4 1)) (.cse63 (<= 1 ULTIMATE.start_main_~y~4)) (.cse75 (<= 11 ULTIMATE.start_main_~y~4)) (.cse74 (<= ULTIMATE.start_main_~y~4 11)) (.cse90 (<= ULTIMATE.start_main_~y~4 27)) (.cse91 (<= 27 ULTIMATE.start_main_~y~4)) (.cse86 (<= 20 ULTIMATE.start_main_~y~4)) (.cse87 (<= ULTIMATE.start_main_~y~4 20)) (.cse60 (<= 39 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 39)) (.cse84 (<= ULTIMATE.start_main_~y~4 22)) (.cse85 (<= 22 ULTIMATE.start_main_~y~4)) (.cse36 (<= ULTIMATE.start_main_~y~4 10)) (.cse37 (<= 10 ULTIMATE.start_main_~y~4)) (.cse33 (<= 37 ULTIMATE.start_main_~y~4)) (.cse32 (<= ULTIMATE.start_main_~y~4 37)) (.cse10 (<= ULTIMATE.start_main_~y~4 29)) (.cse11 (<= 29 ULTIMATE.start_main_~y~4)) (.cse56 (<= ULTIMATE.start_main_~y~4 28)) (.cse57 (<= 28 ULTIMATE.start_main_~y~4)) (.cse46 (<= 21 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 21)) (.cse89 (<= 19 ULTIMATE.start_main_~y~4)) (.cse88 (<= ULTIMATE.start_main_~y~4 19)) (.cse99 (<= ULTIMATE.start_main_~y~4 43)) (.cse98 (<= 43 ULTIMATE.start_main_~y~4)) (.cse45 (<= ULTIMATE.start_main_~y~4 38)) (.cse44 (<= 38 ULTIMATE.start_main_~y~4)) (.cse83 (<= ULTIMATE.start_main_~y~4 41)) (.cse82 (<= 41 ULTIMATE.start_main_~y~4)) (.cse31 (<= 7 ULTIMATE.start_main_~y~4)) (.cse30 (<= ULTIMATE.start_main_~y~4 7)) (.cse8 (<= ULTIMATE.start_main_~y~4 30)) (.cse9 (<= 30 ULTIMATE.start_main_~y~4)) (.cse76 (<= 31 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 31)) (.cse59 (<= 34 ULTIMATE.start_main_~y~4)) (.cse58 (<= ULTIMATE.start_main_~y~4 34)) (.cse96 (<= 24 ULTIMATE.start_main_~y~4)) (.cse97 (<= ULTIMATE.start_main_~y~4 24)) (.cse50 (<= ULTIMATE.start_main_~y~4 23)) (.cse51 (<= 23 ULTIMATE.start_main_~y~4))) (or (and (<= ULTIMATE.start_main_~x~4 32) .cse0 (<= 32 ULTIMATE.start_main_~x~4) .cse1) (and .cse2 (<= ULTIMATE.start_main_~x~4 48) (<= 48 ULTIMATE.start_main_~x~4) .cse3) (and (<= 12 ULTIMATE.start_main_~x~4) .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 12)) (and (<= ULTIMATE.start_main_~x~4 5) .cse6 .cse7 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse8 (<= ULTIMATE.start_main_~x~4 30) .cse9 (<= 30 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse10 .cse11) (and (<= 47 ULTIMATE.start_main_~x~4) .cse12 (<= ULTIMATE.start_main_~x~4 47) .cse13) (and (<= ULTIMATE.start_main_~x~4 64) .cse14 .cse15 (<= 64 ULTIMATE.start_main_~x~4)) (and (<= 83 ULTIMATE.start_main_~x~4) .cse16 .cse17 (<= ULTIMATE.start_main_~x~4 83)) (and (<= ULTIMATE.start_main_~x~4 26) .cse18 .cse19 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 49 ULTIMATE.start_main_~x~4) .cse20 .cse21 (<= ULTIMATE.start_main_~x~4 49)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse20 .cse21 (<= ULTIMATE.start_main_~x~4 51)) (and (<= ULTIMATE.start_main_~x~4 54) .cse22 (<= 54 ULTIMATE.start_main_~x~4) .cse23) (and .cse24 (<= 60 ULTIMATE.start_main_~x~4) .cse25 (<= ULTIMATE.start_main_~x~4 60)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and .cse26 (<= ULTIMATE.start_main_~x~4 98) .cse27 (<= 98 ULTIMATE.start_main_~x~4)) (and (<= 36 ULTIMATE.start_main_~x~4) .cse14 (<= ULTIMATE.start_main_~x~4 36) .cse15) (and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and (<= ULTIMATE.start_main_~x~4 7) .cse30 .cse31 (<= 7 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) .cse32 .cse33 (<= ULTIMATE.start_main_~x~4 63)) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse12 .cse13) (and .cse34 .cse35 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and .cse36 (<= ULTIMATE.start_main_~x~4 10) .cse37 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 67 ULTIMATE.start_main_~x~4) .cse38 .cse39 (<= ULTIMATE.start_main_~x~4 67)) (and .cse40 .cse41 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 33) .cse38 (<= 33 ULTIMATE.start_main_~x~4) .cse39) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse42 .cse43) (and .cse44 (<= ULTIMATE.start_main_~x~4 62) .cse45 (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse42 .cse43) (and (<= 79 ULTIMATE.start_main_~x~4) .cse46 (<= ULTIMATE.start_main_~x~4 79) .cse47) (and .cse48 .cse49 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse50 .cse51) (and .cse52 (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse53) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse54 .cse55 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse35 (<= 15 ULTIMATE.start_main_~x~4) .cse34 (<= ULTIMATE.start_main_~x~4 15)) (and .cse56 (<= ULTIMATE.start_main_~x~4 28) .cse57 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse58 .cse59) (and .cse27 .cse26 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and .cse6 .cse7 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95)) (and (<= 61 ULTIMATE.start_main_~x~4) .cse60 (<= ULTIMATE.start_main_~x~4 61) .cse61) (and (<= ULTIMATE.start_main_~x~4 1) .cse62 .cse63 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 8) .cse64 .cse65 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse66 (<= ULTIMATE.start_main_~x~4 87) .cse67 (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 74 ULTIMATE.start_main_~x~4) .cse18 (<= ULTIMATE.start_main_~x~4 74) .cse19) (and .cse68 (<= 45 ULTIMATE.start_main_~x~4) .cse69 (<= ULTIMATE.start_main_~x~4 45)) (and .cse70 (<= 58 ULTIMATE.start_main_~x~4) .cse71 (<= ULTIMATE.start_main_~x~4 58)) (and .cse72 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse73) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse53 .cse52) (and (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse68 .cse69) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse74 .cse75) (and (<= ULTIMATE.start_main_~x~4 40) .cse25 (<= 40 ULTIMATE.start_main_~x~4) .cse24) (and .cse76 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) .cse77) (and .cse40 .cse41 (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse5 .cse4) (and (<= ULTIMATE.start_main_~x~4 17) .cse16 .cse17 (<= 17 ULTIMATE.start_main_~x~4)) (and .cse78 .cse79 (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)) (and .cse80 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse81) (and .cse81 (<= ULTIMATE.start_main_~x~4 91) .cse80 (<= 91 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 59) .cse82 .cse83 (<= 59 ULTIMATE.start_main_~x~4)) (and .cse71 .cse70 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)) (and .cse78 (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse79) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse3 .cse2) (and .cse84 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4) .cse85) (and (<= ULTIMATE.start_main_~x~4 46) .cse23 (<= 46 ULTIMATE.start_main_~x~4) .cse22) (and (<= ULTIMATE.start_main_~x~4 80) .cse86 (<= 80 ULTIMATE.start_main_~x~4) .cse87) (and (<= ULTIMATE.start_main_~x~4 92) .cse64 .cse65 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse72 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4) .cse73) (and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse88 .cse89) (and (<= 6 ULTIMATE.start_main_~x~4) .cse49 .cse48 (<= ULTIMATE.start_main_~x~4 6)) (and .cse90 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4) .cse91) (and (<= ULTIMATE.start_main_~x~4 35) .cse54 (<= 35 ULTIMATE.start_main_~x~4) .cse55) (and (<= 86 ULTIMATE.start_main_~x~4) .cse92 .cse93 (<= ULTIMATE.start_main_~x~4 86)) (and (<= 3 ULTIMATE.start_main_~x~4) .cse94 .cse95 (<= ULTIMATE.start_main_~x~4 3)) (and (<= ULTIMATE.start_main_~x~4 84) .cse29 (<= 84 ULTIMATE.start_main_~x~4) .cse28) (and .cse66 .cse67 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)) (and .cse95 .cse94 (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 97)) (and .cse92 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse93) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse62 .cse63) (and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse75 .cse74) (and .cse90 (<= ULTIMATE.start_main_~x~4 27) .cse91 (<= 27 ULTIMATE.start_main_~x~4)) (and (<= 20 ULTIMATE.start_main_~x~4) .cse86 (<= ULTIMATE.start_main_~x~4 20) .cse87) (and .cse60 (<= ULTIMATE.start_main_~x~4 39) .cse61 (<= 39 ULTIMATE.start_main_~x~4)) (and .cse84 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4) .cse85) (and .cse36 (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4) .cse37) (and .cse33 (<= ULTIMATE.start_main_~x~4 37) .cse32 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse96 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse97) (and (<= 29 ULTIMATE.start_main_~x~4) .cse10 .cse11 (<= ULTIMATE.start_main_~x~4 29)) (and (<= 72 ULTIMATE.start_main_~x~4) .cse56 .cse57 (<= ULTIMATE.start_main_~x~4 72)) (and (<= ULTIMATE.start_main_~x~4 21) .cse46 (<= 21 ULTIMATE.start_main_~x~4) .cse47) (and .cse98 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse99) (and .cse89 (<= 19 ULTIMATE.start_main_~x~4) .cse88 (<= ULTIMATE.start_main_~x~4 19)) (and (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse99 .cse98) (and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38) .cse45 .cse44) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse83 .cse82) (and .cse31 .cse30 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and .cse8 (<= ULTIMATE.start_main_~x~4 70) .cse9 (<= 70 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 31) .cse76 .cse77 (<= 31 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) .cse59 (<= ULTIMATE.start_main_~x~4 66) .cse58) (and (<= ULTIMATE.start_main_~x~4 76) .cse96 .cse97 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4) .cse50 .cse51))) [2018-12-03 15:25:48,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 54) no Hoare annotation was computed. [2018-12-03 15:25:48,917 INFO L444 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: false [2018-12-03 15:25:48,919 INFO L444 ceAbstractionStarter]: At program point L36(lines 30 47) the Hoare annotation is: (let ((.cse12 (<= ULTIMATE.start_main_~y~4 27)) (.cse13 (<= 27 ULTIMATE.start_main_~y~4)) (.cse6 (<= 8 ULTIMATE.start_main_~y~4)) (.cse7 (<= ULTIMATE.start_main_~y~4 8)) (.cse33 (<= 34 ULTIMATE.start_main_~y~4)) (.cse32 (<= ULTIMATE.start_main_~y~4 34)) (.cse26 (<= 21 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 21)) (.cse2 (<= ULTIMATE.start_main_~y~4 28)) (.cse3 (<= 28 ULTIMATE.start_main_~y~4)) (.cse29 (<= 33 ULTIMATE.start_main_~y~4)) (.cse28 (<= ULTIMATE.start_main_~y~4 33)) (.cse18 (<= 18 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 18)) (.cse8 (<= ULTIMATE.start_main_~y~4 9)) (.cse9 (<= 9 ULTIMATE.start_main_~y~4)) (.cse30 (<= ULTIMATE.start_main_~y~4 10)) (.cse31 (<= 10 ULTIMATE.start_main_~y~4)) (.cse56 (<= 4 ULTIMATE.start_main_~y~4)) (.cse57 (<= ULTIMATE.start_main_~y~4 4)) (.cse63 (<= ULTIMATE.start_main_~y~4 29)) (.cse62 (<= 29 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 15)) (.cse17 (<= 15 ULTIMATE.start_main_~y~4)) (.cse1 (<= 23 ULTIMATE.start_main_~y~4)) (.cse0 (<= ULTIMATE.start_main_~y~4 23)) (.cse51 (<= ULTIMATE.start_main_~y~4 42)) (.cse50 (<= 42 ULTIMATE.start_main_~y~4)) (.cse59 (<= 5 ULTIMATE.start_main_~y~4)) (.cse58 (<= ULTIMATE.start_main_~y~4 5)) (.cse14 (<= 31 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 31)) (.cse34 (<= ULTIMATE.start_main_~y~4 11)) (.cse35 (<= 11 ULTIMATE.start_main_~y~4)) (.cse10 (<= ULTIMATE.start_main_~y~4 13)) (.cse11 (<= 13 ULTIMATE.start_main_~y~4)) (.cse72 (<= 12 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 12)) (.cse36 (<= 17 ULTIMATE.start_main_~y~4)) (.cse37 (<= ULTIMATE.start_main_~y~4 17)) (.cse22 (<= 43 ULTIMATE.start_main_~y~4)) (.cse23 (<= ULTIMATE.start_main_~y~4 43)) (.cse80 (<= 14 ULTIMATE.start_main_~y~4)) (.cse81 (<= ULTIMATE.start_main_~y~4 14)) (.cse78 (<= ULTIMATE.start_main_~y~4 2)) (.cse79 (<= 2 ULTIMATE.start_main_~y~4)) (.cse86 (<= 37 ULTIMATE.start_main_~y~4)) (.cse87 (<= ULTIMATE.start_main_~y~4 37)) (.cse88 (<= 24 ULTIMATE.start_main_~y~4)) (.cse89 (<= ULTIMATE.start_main_~y~4 24)) (.cse82 (<= ULTIMATE.start_main_~y~4 7)) (.cse83 (<= 7 ULTIMATE.start_main_~y~4)) (.cse60 (<= 32 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 32)) (.cse46 (<= 20 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 20)) (.cse66 (<= 48 ULTIMATE.start_main_~y~4)) (.cse67 (<= ULTIMATE.start_main_~y~4 48)) (.cse94 (<= ULTIMATE.start_main_~y~4 1)) (.cse95 (<= 1 ULTIMATE.start_main_~y~4)) (.cse4 (<= ULTIMATE.start_main_~y~4 44)) (.cse5 (<= 44 ULTIMATE.start_main_~y~4)) (.cse64 (<= ULTIMATE.start_main_~y~4 22)) (.cse65 (<= 22 ULTIMATE.start_main_~y~4)) (.cse84 (<= 16 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 16)) (.cse52 (<= 47 ULTIMATE.start_main_~y~4)) (.cse53 (<= ULTIMATE.start_main_~y~4 47)) (.cse70 (<= 39 ULTIMATE.start_main_~y~4)) (.cse71 (<= ULTIMATE.start_main_~y~4 39)) (.cse20 (<= 25 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 25)) (.cse39 (<= ULTIMATE.start_main_~y~4 40)) (.cse38 (<= 40 ULTIMATE.start_main_~y~4)) (.cse75 (<= 26 ULTIMATE.start_main_~y~4)) (.cse74 (<= ULTIMATE.start_main_~y~4 26)) (.cse91 (<= 6 ULTIMATE.start_main_~y~4)) (.cse90 (<= ULTIMATE.start_main_~y~4 6)) (.cse69 (<= 36 ULTIMATE.start_main_~y~4)) (.cse68 (<= ULTIMATE.start_main_~y~4 36)) (.cse24 (<= 49 ULTIMATE.start_main_~y~4)) (.cse25 (<= ULTIMATE.start_main_~y~4 49)) (.cse49 (<= 19 ULTIMATE.start_main_~y~4)) (.cse48 (<= ULTIMATE.start_main_~y~4 19)) (.cse41 (<= ULTIMATE.start_main_~y~4 46)) (.cse40 (<= 46 ULTIMATE.start_main_~y~4)) (.cse55 (<= 41 ULTIMATE.start_main_~y~4)) (.cse54 (<= ULTIMATE.start_main_~y~4 41)) (.cse43 (<= 35 ULTIMATE.start_main_~y~4)) (.cse42 (<= ULTIMATE.start_main_~y~4 35)) (.cse76 (<= ULTIMATE.start_main_~y~4 3)) (.cse77 (<= 3 ULTIMATE.start_main_~y~4)) (.cse97 (<= ULTIMATE.start_main_~y~4 38)) (.cse96 (<= 38 ULTIMATE.start_main_~y~4)) (.cse92 (<= 45 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 45)) (.cse44 (<= ULTIMATE.start_main_~y~4 30)) (.cse45 (<= 30 ULTIMATE.start_main_~y~4))) (or (and .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse2 .cse3) (and .cse4 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse5) (and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4) .cse6 .cse7) (and .cse8 (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4) .cse9) (and (<= 12 ULTIMATE.start_main_~x~4) .cse10 .cse11 (<= ULTIMATE.start_main_~x~4 12)) (and .cse12 (<= 72 ULTIMATE.start_main_~x~4) .cse13 (<= ULTIMATE.start_main_~x~4 72)) (and .cse14 (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse15) (and .cse16 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse17) (and .cse18 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse19) (and .cse20 (<= 74 ULTIMATE.start_main_~x~4) .cse21 (<= ULTIMATE.start_main_~x~4 74)) (and .cse12 (<= ULTIMATE.start_main_~x~4 26) .cse13 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) .cse22 (<= ULTIMATE.start_main_~x~4 56) .cse23) (and (<= ULTIMATE.start_main_~x~4 50) .cse24 (<= 50 ULTIMATE.start_main_~x~4) .cse25) (and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4) .cse6 .cse7) (and (<= ULTIMATE.start_main_~x~4 78) .cse26 (<= 78 ULTIMATE.start_main_~x~4) .cse27) (and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66) .cse28 .cse29) (and .cse30 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse31) (and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4) .cse32 .cse33) (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse34 .cse35) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse36 .cse37) (and (<= ULTIMATE.start_main_~x~4 59) .cse38 .cse39 (<= 59 ULTIMATE.start_main_~x~4)) (and .cse40 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse41) (and .cse33 .cse32 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and (<= 20 ULTIMATE.start_main_~x~4) .cse26 (<= ULTIMATE.start_main_~x~4 20) .cse27) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) .cse42 .cse43) (and .cse44 (<= 29 ULTIMATE.start_main_~x~4) .cse45 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 27) .cse2 (<= 27 ULTIMATE.start_main_~x~4) .cse3) (and .cse46 (<= 79 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 79) .cse47) (and (<= ULTIMATE.start_main_~x~4 32) .cse29 (<= 32 ULTIMATE.start_main_~x~4) .cse28) (and (<= ULTIMATE.start_main_~x~4 80) .cse48 .cse49 (<= 80 ULTIMATE.start_main_~x~4)) (and .cse18 (<= ULTIMATE.start_main_~x~4 17) .cse19 (<= 17 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 90) .cse8 (<= 90 ULTIMATE.start_main_~x~4) .cse9) (and .cse50 .cse51 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and (<= ULTIMATE.start_main_~x~4 46) .cse52 (<= 46 ULTIMATE.start_main_~x~4) .cse53) (and .cse30 (<= 9 ULTIMATE.start_main_~x~4) .cse31 (<= ULTIMATE.start_main_~x~4 9)) (and (<= ULTIMATE.start_main_~x~4 40) .cse54 (<= 40 ULTIMATE.start_main_~x~4) .cse55) (and (<= 3 ULTIMATE.start_main_~x~4) .cse56 (<= ULTIMATE.start_main_~x~4 3) .cse57) (and (<= ULTIMATE.start_main_~y~4 0) (<= 0 ULTIMATE.start_main_~y~4) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and .cse58 .cse59 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 67 ULTIMATE.start_main_~x~4) .cse60 .cse61 (<= ULTIMATE.start_main_~x~4 67)) (and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse62 .cse63) (and .cse56 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse57) (and (<= ULTIMATE.start_main_~x~4 28) .cse63 .cse62 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 21) .cse64 (<= 21 ULTIMATE.start_main_~x~4) .cse65) (and .cse16 (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4) .cse17) (and (<= ULTIMATE.start_main_~x~4 76) .cse1 .cse0 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse66 .cse67 (<= ULTIMATE.start_main_~x~4 51)) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse51 .cse50) (and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse68 .cse69) (and .cse70 .cse71 (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)) (and .cse59 .cse58 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 30) .cse14 (<= 30 ULTIMATE.start_main_~x~4) .cse15) (and .cse72 (<= ULTIMATE.start_main_~x~4 87) .cse73 (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 10) .cse34 .cse35 (<= 10 ULTIMATE.start_main_~x~4)) (and .cse74 (<= ULTIMATE.start_main_~x~4 25) .cse75 (<= 25 ULTIMATE.start_main_~x~4)) (and .cse10 .cse11 (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse72 .cse73) (and .cse76 .cse77 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and .cse78 (<= 97 ULTIMATE.start_main_~x~4) .cse79 (<= ULTIMATE.start_main_~x~4 97)) (and .cse80 .cse81 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and .cse82 (<= ULTIMATE.start_main_~x~4 92) .cse83 (<= 92 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4) .cse36 .cse37) (and (<= 15 ULTIMATE.start_main_~x~4) .cse84 .cse85 (<= ULTIMATE.start_main_~x~4 15)) (and (<= 36 ULTIMATE.start_main_~x~4) .cse86 .cse87 (<= ULTIMATE.start_main_~x~4 36)) (and .cse22 (<= ULTIMATE.start_main_~x~4 42) .cse23 (<= 42 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse88 .cse89) (and .cse80 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse81) (and (<= ULTIMATE.start_main_~y~4 50) (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) (<= 50 ULTIMATE.start_main_~y~4)) (and .cse78 .cse79 (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) .cse86 .cse87 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse90 .cse91 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse88 .cse89) (and .cse82 (<= 6 ULTIMATE.start_main_~x~4) .cse83 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 31) .cse60 (<= 31 ULTIMATE.start_main_~x~4) .cse61) (and .cse46 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse47) (and .cse66 (<= 47 ULTIMATE.start_main_~x~4) .cse67 (<= ULTIMATE.start_main_~x~4 47)) (and (<= (+ ULTIMATE.start_main_~y~4 1) 0) (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse92 .cse93) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) .cse94 .cse95) (and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse94 .cse95) (and (<= ULTIMATE.start_main_~x~4 43) .cse4 .cse5 (<= 43 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 77) .cse64 .cse65 (<= 77 ULTIMATE.start_main_~x~4)) (and (<= 83 ULTIMATE.start_main_~x~4) .cse84 .cse85 (<= ULTIMATE.start_main_~x~4 83)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse52 .cse53) (and (<= 61 ULTIMATE.start_main_~x~4) .cse96 (<= ULTIMATE.start_main_~x~4 61) .cse97) (and (<= 38 ULTIMATE.start_main_~x~4) .cse70 (<= ULTIMATE.start_main_~x~4 38) .cse71) (and .cse20 (<= ULTIMATE.start_main_~x~4 24) .cse21 (<= 24 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 39) .cse39 (<= 39 ULTIMATE.start_main_~x~4) .cse38) (and .cse75 .cse74 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 5) .cse91 .cse90 (<= 5 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) .cse69 .cse68 (<= ULTIMATE.start_main_~x~4 63)) (and (<= 48 ULTIMATE.start_main_~x~4) .cse24 .cse25 (<= ULTIMATE.start_main_~x~4 48)) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse49 .cse48) (and .cse41 .cse40 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and .cse55 .cse54 (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse43 .cse42) (and .cse76 .cse77 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 37) .cse97 .cse96 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse92 (<= ULTIMATE.start_main_~x~4 54) (<= 54 ULTIMATE.start_main_~x~4) .cse93) (and .cse44 .cse45 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)))) [2018-12-03 15:25:48,952 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:25:48 BoogieIcfgContainer [2018-12-03 15:25:48,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:25:48,953 INFO L168 Benchmark]: Toolchain (without parser) took 252140.43 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-12-03 15:25:48,954 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:25:48,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.88 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:25:48,955 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 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:25:48,955 INFO L168 Benchmark]: RCFGBuilder took 315.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 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:25:48,955 INFO L168 Benchmark]: TraceAbstraction took 251759.59 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-12-03 15:25:48,958 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.20 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 36.88 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 24.59 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 315.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251759.59 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: 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: 46]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~x~4 <= 32 && 32 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 32) || (((main_~y~4 <= 48 && main_~x~4 <= 48) && 48 <= main_~x~4) && 48 <= main_~y~4)) || (((12 <= main_~x~4 && 12 <= main_~y~4) && main_~y~4 <= 12) && main_~x~4 <= 12)) || (((main_~x~4 <= 5 && 5 <= main_~y~4) && main_~y~4 <= 5) && 5 <= main_~x~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 30) && 30 <= main_~y~4) && 30 <= main_~x~4)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((47 <= main_~x~4 && 47 <= main_~y~4) && main_~x~4 <= 47) && main_~y~4 <= 47)) || (((main_~x~4 <= 64 && main_~y~4 <= 36) && 36 <= main_~y~4) && 64 <= main_~x~4)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || (((main_~x~4 <= 26 && main_~y~4 <= 26) && 26 <= main_~y~4) && 26 <= main_~x~4)) || (((49 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 49)) || (((51 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 51)) || (((main_~x~4 <= 54 && main_~y~4 <= 46) && 54 <= main_~x~4) && 46 <= main_~y~4)) || (((40 <= main_~y~4 && 60 <= main_~x~4) && main_~y~4 <= 40) && main_~x~4 <= 60)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((2 <= main_~y~4 && main_~x~4 <= 98) && main_~y~4 <= 2) && 98 <= main_~x~4)) || (((36 <= main_~x~4 && main_~y~4 <= 36) && main_~x~4 <= 36) && 36 <= main_~y~4)) || (((main_~x~4 <= 16 && 16 <= main_~x~4) && 16 <= main_~y~4) && main_~y~4 <= 16)) || (((main_~x~4 <= 7 && main_~y~4 <= 7) && 7 <= main_~y~4) && 7 <= main_~x~4)) || (((63 <= main_~x~4 && main_~y~4 <= 37) && 37 <= main_~y~4) && main_~x~4 <= 63)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && 47 <= main_~y~4) && main_~y~4 <= 47)) || (((15 <= main_~y~4 && main_~y~4 <= 15) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 10 && main_~x~4 <= 10) && 10 <= main_~y~4) && 10 <= main_~x~4)) || (((67 <= main_~x~4 && 33 <= main_~y~4) && main_~y~4 <= 33) && main_~x~4 <= 67)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 0) && 0 <= main_~x~4)) || (((main_~x~4 <= 33 && 33 <= main_~y~4) && 33 <= main_~x~4) && main_~y~4 <= 33)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((38 <= main_~y~4 && main_~x~4 <= 62) && main_~y~4 <= 38) && 62 <= main_~x~4)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((79 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 21)) || (((main_~y~4 <= 6 && 6 <= main_~y~4) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 23) && 23 <= main_~y~4)) || (((18 <= main_~y~4 && 18 <= main_~x~4) && main_~x~4 <= 18) && main_~y~4 <= 18)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 32 <= main_~y~4) && main_~y~4 <= 32)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~y~4 <= 15 && 15 <= main_~x~4) && 15 <= main_~y~4) && main_~x~4 <= 15)) || (((main_~y~4 <= 28 && main_~x~4 <= 28) && 28 <= main_~y~4) && 28 <= main_~x~4)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && 95 <= main_~x~4) && main_~x~4 <= 95)) || (((61 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 39)) || (((main_~x~4 <= 1 && main_~y~4 <= 1) && 1 <= main_~y~4) && 1 <= main_~x~4)) || (((main_~x~4 <= 8 && 8 <= main_~y~4) && main_~y~4 <= 8) && 8 <= main_~x~4)) || (((main_~y~4 <= 13 && main_~x~4 <= 87) && 13 <= main_~y~4) && 87 <= main_~x~4)) || (((74 <= main_~x~4 && main_~y~4 <= 26) && main_~x~4 <= 74) && 26 <= main_~y~4)) || (((45 <= main_~y~4 && 45 <= main_~x~4) && main_~y~4 <= 45) && main_~x~4 <= 45)) || (((42 <= main_~y~4 && 58 <= main_~x~4) && main_~y~4 <= 42) && main_~x~4 <= 58)) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && main_~y~4 <= 18) && 18 <= main_~y~4)) || (((55 <= main_~x~4 && main_~x~4 <= 55) && 45 <= main_~y~4) && main_~y~4 <= 45)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 40) && 40 <= main_~x~4) && 40 <= main_~y~4)) || (((31 <= main_~y~4 && 69 <= main_~x~4) && main_~x~4 <= 69) && main_~y~4 <= 31)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((88 <= main_~x~4 && main_~x~4 <= 88) && main_~y~4 <= 12) && 12 <= main_~y~4)) || (((main_~x~4 <= 17 && 17 <= main_~y~4) && main_~y~4 <= 17) && 17 <= main_~x~4)) || (((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 <= 25) && 25 <= main_~x~4)) || (((main_~y~4 <= 9 && 9 <= main_~x~4) && main_~x~4 <= 9) && 9 <= main_~y~4)) || (((9 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 9) && 91 <= main_~x~4)) || (((main_~x~4 <= 59 && 41 <= main_~y~4) && main_~y~4 <= 41) && 59 <= main_~x~4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && main_~x~4 <= 42) && 42 <= main_~x~4)) || (((25 <= main_~y~4 && main_~x~4 <= 75) && 75 <= main_~x~4) && main_~y~4 <= 25)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 48 <= main_~y~4) && main_~y~4 <= 48)) || (((main_~y~4 <= 22 && main_~x~4 <= 22) && 22 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~x~4 <= 46 && 46 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 46)) || (((main_~x~4 <= 80 && 20 <= main_~y~4) && 80 <= main_~x~4) && main_~y~4 <= 20)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((4 <= main_~y~4 && main_~x~4 <= 4) && 4 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 81 && 81 <= main_~x~4) && main_~y~4 <= 19) && 19 <= main_~y~4)) || (((6 <= main_~x~4 && 6 <= main_~y~4) && main_~y~4 <= 6) && main_~x~4 <= 6)) || (((main_~y~4 <= 27 && main_~x~4 <= 73) && 73 <= main_~x~4) && 27 <= main_~y~4)) || (((main_~x~4 <= 35 && 35 <= main_~y~4) && 35 <= main_~x~4) && main_~y~4 <= 35)) || (((86 <= main_~x~4 && 14 <= main_~y~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || (((3 <= main_~x~4 && main_~y~4 <= 3) && 3 <= main_~y~4) && main_~x~4 <= 3)) || (((main_~x~4 <= 84 && main_~y~4 <= 16) && 84 <= main_~x~4) && 16 <= main_~y~4)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && main_~x~4 <= 13) && 13 <= main_~x~4)) || (((3 <= main_~y~4 && main_~y~4 <= 3) && 97 <= main_~x~4) && main_~x~4 <= 97)) || (((14 <= main_~y~4 && 14 <= main_~x~4) && main_~x~4 <= 14) && main_~y~4 <= 14)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 89 && 89 <= main_~x~4) && 11 <= main_~y~4) && main_~y~4 <= 11)) || (((main_~y~4 <= 27 && main_~x~4 <= 27) && 27 <= main_~y~4) && 27 <= main_~x~4)) || (((20 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 20)) || (((39 <= main_~y~4 && main_~x~4 <= 39) && main_~y~4 <= 39) && 39 <= main_~x~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 78) && 78 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 90 <= main_~x~4) && 10 <= main_~y~4)) || (((37 <= main_~y~4 && main_~x~4 <= 37) && main_~y~4 <= 37) && 37 <= main_~x~4)) || (((24 <= main_~y~4 && main_~x~4 <= 24) && 24 <= main_~x~4) && main_~y~4 <= 24)) || (((29 <= main_~x~4 && main_~y~4 <= 29) && 29 <= main_~y~4) && main_~x~4 <= 29)) || (((72 <= main_~x~4 && main_~y~4 <= 28) && 28 <= main_~y~4) && main_~x~4 <= 72)) || (((main_~x~4 <= 21 && 21 <= main_~y~4) && 21 <= main_~x~4) && main_~y~4 <= 21)) || (((43 <= main_~y~4 && main_~x~4 <= 43) && 43 <= main_~x~4) && main_~y~4 <= 43)) || (((19 <= main_~y~4 && 19 <= main_~x~4) && main_~y~4 <= 19) && main_~x~4 <= 19)) || (((57 <= main_~x~4 && main_~x~4 <= 57) && main_~y~4 <= 43) && 43 <= main_~y~4)) || (((38 <= main_~x~4 && main_~x~4 <= 38) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 41) && 41 <= main_~y~4)) || (((7 <= main_~y~4 && main_~y~4 <= 7) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 30 <= main_~y~4) && 70 <= main_~x~4)) || (((main_~x~4 <= 31 && 31 <= main_~y~4) && main_~y~4 <= 31) && 31 <= main_~x~4)) || (((66 <= main_~x~4 && 34 <= main_~y~4) && main_~x~4 <= 66) && main_~y~4 <= 34)) || (((main_~x~4 <= 76 && 24 <= main_~y~4) && main_~y~4 <= 24) && 76 <= main_~x~4)) || (((main_~x~4 <= 77 && 77 <= main_~x~4) && main_~y~4 <= 23) && 23 <= main_~y~4) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 28) && 28 <= main_~y~4)) || (((main_~y~4 <= 44 && 55 <= main_~x~4) && main_~x~4 <= 55) && 44 <= main_~y~4)) || (((main_~x~4 <= 7 && 7 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((main_~y~4 <= 9 && main_~x~4 <= 8) && 8 <= main_~x~4) && 9 <= main_~y~4)) || (((12 <= main_~x~4 && main_~y~4 <= 13) && 13 <= main_~y~4) && main_~x~4 <= 12)) || (((main_~y~4 <= 27 && 72 <= main_~x~4) && 27 <= main_~y~4) && main_~x~4 <= 72)) || (((31 <= main_~y~4 && main_~x~4 <= 68) && 68 <= main_~x~4) && main_~y~4 <= 31)) || (((main_~y~4 <= 15 && 14 <= main_~x~4) && main_~x~4 <= 14) && 15 <= main_~y~4)) || (((18 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 18)) || (((25 <= main_~y~4 && 74 <= main_~x~4) && main_~y~4 <= 25) && main_~x~4 <= 74)) || (((main_~y~4 <= 27 && main_~x~4 <= 26) && 27 <= main_~y~4) && 26 <= main_~x~4)) || (((56 <= main_~x~4 && 43 <= main_~y~4) && main_~x~4 <= 56) && main_~y~4 <= 43)) || (((main_~x~4 <= 50 && 49 <= main_~y~4) && 50 <= main_~x~4) && main_~y~4 <= 49)) || (((main_~x~4 <= 91 && 91 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((main_~x~4 <= 78 && 21 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 21)) || (((66 <= main_~x~4 && main_~x~4 <= 66) && main_~y~4 <= 33) && 33 <= main_~y~4)) || (((main_~y~4 <= 10 && main_~x~4 <= 89) && 89 <= main_~x~4) && 10 <= main_~y~4)) || (((main_~x~4 <= 33 && 33 <= main_~x~4) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((88 <= main_~x~4 && main_~x~4 <= 88) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~x~4 <= 59 && 40 <= main_~y~4) && main_~y~4 <= 40) && 59 <= main_~x~4)) || (((46 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 46)) || (((34 <= main_~y~4 && main_~y~4 <= 34) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((20 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 21)) || (((main_~x~4 <= 64 && 64 <= main_~x~4) && main_~y~4 <= 35) && 35 <= main_~y~4)) || (((main_~y~4 <= 30 && 29 <= main_~x~4) && 30 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 27 && main_~y~4 <= 28) && 27 <= main_~x~4) && 28 <= main_~y~4)) || (((20 <= main_~y~4 && 79 <= main_~x~4) && main_~x~4 <= 79) && main_~y~4 <= 20)) || (((main_~x~4 <= 32 && 33 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 33)) || (((main_~x~4 <= 80 && main_~y~4 <= 19) && 19 <= main_~y~4) && 80 <= main_~x~4)) || (((18 <= main_~y~4 && main_~x~4 <= 17) && main_~y~4 <= 18) && 17 <= main_~x~4)) || (((main_~x~4 <= 90 && main_~y~4 <= 9) && 90 <= main_~x~4) && 9 <= main_~y~4)) || (((42 <= main_~y~4 && main_~y~4 <= 42) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((main_~x~4 <= 46 && 47 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 47)) || (((main_~y~4 <= 10 && 9 <= main_~x~4) && 10 <= main_~y~4) && main_~x~4 <= 9)) || (((main_~x~4 <= 40 && main_~y~4 <= 41) && 40 <= main_~x~4) && 41 <= main_~y~4)) || (((3 <= main_~x~4 && 4 <= main_~y~4) && main_~x~4 <= 3) && main_~y~4 <= 4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((main_~y~4 <= 5 && 5 <= main_~y~4) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((67 <= main_~x~4 && 32 <= main_~y~4) && main_~y~4 <= 32) && main_~x~4 <= 67)) || (((main_~x~4 <= 70 && 70 <= main_~x~4) && 29 <= main_~y~4) && main_~y~4 <= 29)) || (((4 <= main_~y~4 && 95 <= main_~x~4) && main_~x~4 <= 95) && main_~y~4 <= 4)) || (((main_~x~4 <= 28 && main_~y~4 <= 29) && 29 <= main_~y~4) && 28 <= main_~x~4)) || (((main_~x~4 <= 21 && main_~y~4 <= 22) && 21 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 15 && main_~x~4 <= 84) && 84 <= main_~x~4) && 15 <= main_~y~4)) || (((main_~x~4 <= 76 && 23 <= main_~y~4) && main_~y~4 <= 23) && 76 <= main_~x~4)) || (((51 <= main_~x~4 && 48 <= main_~y~4) && main_~y~4 <= 48) && main_~x~4 <= 51)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 42) && 42 <= main_~y~4)) || (((main_~x~4 <= 35 && 35 <= main_~x~4) && main_~y~4 <= 36) && 36 <= main_~y~4)) || (((39 <= main_~y~4 && main_~y~4 <= 39) && 60 <= main_~x~4) && main_~x~4 <= 60)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 4) && 4 <= main_~x~4)) || (((main_~x~4 <= 30 && 31 <= main_~y~4) && 30 <= main_~x~4) && main_~y~4 <= 31)) || (((12 <= main_~y~4 && main_~x~4 <= 87) && main_~y~4 <= 12) && 87 <= main_~x~4)) || (((main_~x~4 <= 10 && main_~y~4 <= 11) && 11 <= main_~y~4) && 10 <= main_~x~4)) || (((main_~y~4 <= 26 && main_~x~4 <= 25) && 26 <= main_~y~4) && 25 <= main_~x~4)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && 12 <= main_~y~4) && main_~y~4 <= 12)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((main_~y~4 <= 2 && 97 <= main_~x~4) && 2 <= main_~y~4) && main_~x~4 <= 97)) || (((14 <= main_~y~4 && main_~y~4 <= 14) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 7 && main_~x~4 <= 92) && 7 <= main_~y~4) && 92 <= main_~x~4)) || (((main_~x~4 <= 16 && 16 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((15 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 15)) || (((36 <= main_~x~4 && 37 <= main_~y~4) && main_~y~4 <= 37) && main_~x~4 <= 36)) || (((43 <= main_~y~4 && main_~x~4 <= 42) && main_~y~4 <= 43) && 42 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((14 <= main_~y~4 && main_~x~4 <= 13) && 13 <= main_~x~4) && main_~y~4 <= 14)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && main_~x~4 <= 1) && 1 <= main_~x~4)) || (((main_~x~4 <= 62 && 37 <= main_~y~4) && main_~y~4 <= 37) && 62 <= main_~x~4)) || (((main_~y~4 <= 6 && 6 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 75 && 75 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((main_~y~4 <= 7 && 6 <= main_~x~4) && 7 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~x~4 <= 31 && 32 <= main_~y~4) && 31 <= main_~x~4) && main_~y~4 <= 32)) || (((20 <= main_~y~4 && 19 <= main_~x~4) && main_~x~4 <= 19) && main_~y~4 <= 20)) || (((48 <= main_~y~4 && 47 <= main_~x~4) && main_~y~4 <= 48) && main_~x~4 <= 47)) || ((main_~y~4 + 1 <= 0 && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && 45 <= main_~y~4) && main_~y~4 <= 45)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 0 && 0 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 43 && main_~y~4 <= 44) && 44 <= main_~y~4) && 43 <= main_~x~4)) || (((main_~x~4 <= 77 && main_~y~4 <= 22) && 22 <= main_~y~4) && 77 <= main_~x~4)) || (((83 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 83)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 47 <= main_~y~4) && main_~y~4 <= 47)) || (((61 <= main_~x~4 && 38 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 38)) || (((38 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 38) && main_~y~4 <= 39)) || (((25 <= main_~y~4 && main_~x~4 <= 24) && main_~y~4 <= 25) && 24 <= main_~x~4)) || (((main_~x~4 <= 39 && main_~y~4 <= 40) && 39 <= main_~x~4) && 40 <= main_~y~4)) || (((26 <= main_~y~4 && main_~y~4 <= 26) && main_~x~4 <= 73) && 73 <= main_~x~4)) || (((main_~x~4 <= 5 && 6 <= main_~y~4) && main_~y~4 <= 6) && 5 <= main_~x~4)) || (((63 <= main_~x~4 && 36 <= main_~y~4) && main_~y~4 <= 36) && main_~x~4 <= 63)) || (((48 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 48)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && 19 <= main_~y~4) && main_~y~4 <= 19)) || (((main_~y~4 <= 46 && 46 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((41 <= main_~y~4 && main_~y~4 <= 41) && 58 <= main_~x~4) && main_~x~4 <= 58)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && 35 <= main_~y~4) && main_~y~4 <= 35)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~x~4 <= 37 && main_~y~4 <= 38) && 38 <= main_~y~4) && 37 <= main_~x~4)) || (((45 <= main_~y~4 && main_~x~4 <= 54) && 54 <= main_~x~4) && main_~y~4 <= 45)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && 69 <= main_~x~4) && main_~x~4 <= 69) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 251.6s OverallTime, 36 OverallIterations, 102 TraceHistogramMax, 57.5s AutomataDifference, 0.0s DeadEndRemovalTime, 82.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 176 SDtfs, 1082 SDslu, 3999 SDs, 0 SdLazy, 25956 SolverSat, 1886 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9120 GetRequests, 5921 SyntacticMatches, 1088 SemanticMatches, 2111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83265 ImplicationChecksByTransitivity, 87.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2806occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 23.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 2224 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 205 NumberOfFragments, 2628 HoareAnnotationTreeSize, 3 FomulaSimplifications, 129463300896 FormulaSimplificationTreeSizeReduction, 21.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3235187189 FormulaSimplificationTreeSizeReductionInter, 61.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 82.6s InterpolantComputationTime, 7708 NumberOfCodeBlocks, 7708 NumberOfCodeBlocksAsserted, 667 NumberOfCheckSat, 11352 ConstructedInterpolants, 0 QuantifiedInterpolants, 4462564 SizeOfPredicates, 33 NumberOfNonLiveVariables, 11436 ConjunctsInSsa, 1465 ConjunctsInUnsatCore, 102 InterpolantComputations, 3 PerfectInterpolantSequences, 275238/432078 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...