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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:51,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:51,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:51,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:51,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:51,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:51,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:51,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:51,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:51,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:51,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:51,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:51,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:51,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:51,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:51,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:51,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:51,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:51,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:51,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:51,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:51,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:51,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:51,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:51,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:51,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:51,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:51,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:51,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:51,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:51,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:51,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:51,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:51,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:51,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:51,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:51,614 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:51,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:51,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:51,628 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:51,628 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:51,628 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:51,628 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:51,628 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:51,629 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:51,629 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:51,629 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:51,629 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:51,629 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:51,630 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:51,630 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:51,630 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:51,631 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:51,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:51,631 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:51,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:51,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:51,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:51,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:51,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:51,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:51,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:51,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:51,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:51,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:51,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:51,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:51,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:51,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:51,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:51,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:51,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:51,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:51,635 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:51,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:51,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:51,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:51,636 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:51,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:51,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:51,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:51,695 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:51,696 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:51,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:21:51,697 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 15:21:51,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:51,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:51,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:51,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:51,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:51,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:51,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:51,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:51,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:51,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/1) ... [2018-12-03 15:21:51,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:51,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:51,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:51,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:51,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (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:51,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:52,173 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:52,173 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:52,174 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:52 BoogieIcfgContainer [2018-12-03 15:21:52,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:52,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:52,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:52,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:52,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:51" (1/2) ... [2018-12-03 15:21:52,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f3c80 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:52, skipping insertion in model container [2018-12-03 15:21:52,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:52" (2/2) ... [2018-12-03 15:21:52,184 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:21:52,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:52,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:52,219 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:52,250 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:52,251 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:52,251 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:52,251 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:52,251 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:52,252 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:52,252 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:52,252 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 15:21:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:21:52,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:52,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:21:52,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:52,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:21:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:52,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:52,472 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:52,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:52,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:21:52,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:52,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:52,494 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 15:21:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:52,570 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 15:21:52,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:52,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:21:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:52,582 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:52,582 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:52,586 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:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 15:21:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:21:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 15:21:52,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 15:21:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:52,619 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 15:21:52,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 15:21:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:21:52,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:52,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:21:52,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:52,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-12-03 15:21:52,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:52,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:52,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:21:52,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:52,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:21:52,734 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-03 15:21:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:52,895 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 15:21:52,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:52,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 15:21:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:52,897 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:52,897 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:52,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:21:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:21:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:21:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:21:52,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:21:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:52,901 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:21:52,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:21:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:21:52,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:52,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:21:52,903 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:52,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-12-03 15:21:52,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:52,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:53,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:53,007 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 15:21:53,009 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 15:21:53,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:53,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:53,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:53,381 INFO L272 AbstractInterpreter]: Visited 6 different actions 19 times. Merged at 5 different actions 11 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:21:53,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:53,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:53,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,425 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:53,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:53,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:53,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:53,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:53,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:53,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-03 15:21:53,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:53,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:21:53,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:21:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:53,734 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-12-03 15:21:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:53,897 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 15:21:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:21:53,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:21:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:53,899 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:21:53,899 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:21:53,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:21:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:21:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:21:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 15:21:53,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 15:21:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:53,905 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 15:21:53,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:21:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 15:21:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:21:53,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:53,906 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 15:21:53,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:53,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-12-03 15:21:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:53,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:53,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:21:53,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:53,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:53,989 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,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,990 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:54,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:54,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:54,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:21:54,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:54,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:21:54,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:21:54,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:54,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 15:21:54,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:54,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:21:54,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:21:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:54,231 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-12-03 15:21:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:54,286 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 15:21:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:54,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 15:21:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:54,291 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:21:54,291 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:21:54,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:21:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 15:21:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:21:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:21:54,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 15:21:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:54,299 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:21:54,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:21:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:21:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:21:54,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:54,301 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 15:21:54,301 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:54,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:54,301 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-12-03 15:21:54,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:54,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:54,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:54,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:54,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:54,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:54,404 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:54,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:54,404 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:54,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:54,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:54,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:54,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:54,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:54,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:54,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:54,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2018-12-03 15:21:54,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:54,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:21:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:21:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:21:54,738 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2018-12-03 15:21:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:54,775 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 15:21:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:21:54,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 15:21:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:54,779 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:21:54,780 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:21:54,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:21:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:21:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:21:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:21:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 15:21:54,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 15:21:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:54,786 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 15:21:54,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:21:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 15:21:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:21:54,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:54,787 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 15:21:54,787 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:54,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-12-03 15:21:54,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:21:54,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:54,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:54,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:54,898 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:54,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:54,898 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:54,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:54,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:54,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:21:55,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:21:55,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:55,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2018-12-03 15:21:55,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:55,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:21:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:21:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:55,469 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-12-03 15:21:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:55,514 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 15:21:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:21:55,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-12-03 15:21:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:55,515 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:21:55,515 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:21:55,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:21:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:21:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:21:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 15:21:55,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 15:21:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 15:21:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:21:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 15:21:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:21:55,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:55,522 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 15:21:55,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:55,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:55,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-12-03 15:21:55,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:55,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:55,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:55,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:55,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:21:55,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,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 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:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:55,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:55,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:21:55,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:55,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:55,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:55,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:55,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2018-12-03 15:21:55,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:55,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:21:55,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:21:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:21:55,972 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-12-03 15:21:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:56,028 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 15:21:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:21:56,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-12-03 15:21:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:56,029 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:21:56,030 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:21:56,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:21:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:21:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:21:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:21:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 15:21:56,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 15:21:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:56,035 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 15:21:56,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:21:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 15:21:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:21:56,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,037 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-12-03 15:21:56,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 6 times [2018-12-03 15:21:56,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:56,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:56,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:56,175 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:56,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,175 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:56,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:56,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:56,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:56,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:56,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:56,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:56,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:56,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 15:21:56,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:56,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:21:56,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:21:56,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:21:56,635 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-12-03 15:21:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:56,681 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 15:21:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:21:56,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-12-03 15:21:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:56,682 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:21:56,682 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:21:56,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:21:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:21:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:21:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:21:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 15:21:56,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 15:21:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:56,690 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 15:21:56,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:21:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 15:21:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:21:56,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,691 INFO L402 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-12-03 15:21:56,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 7 times [2018-12-03 15:21:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:21:56,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:56,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:56,840 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:56,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,841 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:56,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:56,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:21:56,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:21:57,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-12-03 15:21:57,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:21:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:21:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:21:57,151 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2018-12-03 15:21:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,186 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-03 15:21:57,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:21:57,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-12-03 15:21:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,187 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:21:57,187 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:21:57,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:21:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:21:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:21:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:21:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 15:21:57,263 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 15:21:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,263 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 15:21:57,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:21:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 15:21:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:21:57,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,264 INFO L402 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2018-12-03 15:21:57,264 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1207878301, now seen corresponding path program 8 times [2018-12-03 15:21:57,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:21:57,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:57,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:57,469 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,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,470 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:57,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:57,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:57,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:21:57,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:57,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:21:57,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:21:57,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-12-03 15:21:57,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:21:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:21:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:21:57,826 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-12-03 15:21:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,872 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-03 15:21:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:21:57,877 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 15:21:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,878 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:21:57,878 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:21:57,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:21:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:21:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:21:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:21:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 15:21:57,884 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 15:21:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,884 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 15:21:57,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:21:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 15:21:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:21:57,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,885 INFO L402 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2018-12-03 15:21:57,885 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 207974103, now seen corresponding path program 9 times [2018-12-03 15:21:57,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:21:58,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,078 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:58,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,078 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:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:58,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:58,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:58,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:58,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:21:58,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:21:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:21:58,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:21:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:21:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:21:58,617 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2018-12-03 15:21:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:58,688 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-03 15:21:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:21:58,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-12-03 15:21:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:58,693 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:21:58,693 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:21:58,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:21:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:21:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:21:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:21:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 15:21:58,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 15:21:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:58,699 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 15:21:58,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:21:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 15:21:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:21:58,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:58,700 INFO L402 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2018-12-03 15:21:58,700 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:58,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 864577571, now seen corresponding path program 10 times [2018-12-03 15:21:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 15:21:58,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,865 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:58,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,865 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:58,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:58,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 15:21:59,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 15:21:59,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:59,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-12-03 15:21:59,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:59,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:21:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:21:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:21:59,480 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 23 states. [2018-12-03 15:21:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:59,722 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-03 15:21:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:21:59,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 15:21:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:59,726 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:21:59,726 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:21:59,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:21:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:21:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:21:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:21:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 15:21:59,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 15:21:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:59,732 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 15:21:59,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:21:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 15:21:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:21:59,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:59,734 INFO L402 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2018-12-03 15:21:59,734 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:59,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:59,734 INFO L82 PathProgramCache]: Analyzing trace with hash 595035287, now seen corresponding path program 11 times [2018-12-03 15:21:59,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:21:59,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,996 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,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,997 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:22:00,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:00,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:00,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:22:00,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:00,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:22:00,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:22:00,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 15:22:00,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:22:00,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:22:00,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:22:00,173 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-12-03 15:22:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,247 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 15:22:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:00,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-03 15:22:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,248 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:22:00,249 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:22:00,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:22:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:22:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-12-03 15:22:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:22:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-03 15:22:00,258 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2018-12-03 15:22:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,258 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-03 15:22:00,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:22:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-03 15:22:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:22:00,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,260 INFO L402 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-12-03 15:22:00,260 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 12 times [2018-12-03 15:22:00,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:00,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:22:00,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,388 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:00,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,388 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:22:00,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:00,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:00,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:00,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:00,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:22:00,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:22:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2018-12-03 15:22:00,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:22:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:22:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:22:00,640 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-12-03 15:22:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,672 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-12-03 15:22:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:22:00,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-03 15:22:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,674 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:22:00,674 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:22:00,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:22:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:22:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-12-03 15:22:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:22:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-03 15:22:00,686 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-12-03 15:22:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,687 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-03 15:22:00,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:22:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-03 15:22:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:22:00,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,688 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-12-03 15:22:00,689 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 13 times [2018-12-03 15:22:00,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 15:22:00,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,859 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:00,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,860 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:22:00,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 15:22:01,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 15:22:01,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:01,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-12-03 15:22:01,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:01,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:22:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:22:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:01,129 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-12-03 15:22:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:01,274 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-12-03 15:22:01,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:22:01,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-03 15:22:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:01,276 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:22:01,276 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:22:01,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:22:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-12-03 15:22:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:22:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-12-03 15:22:01,299 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-12-03 15:22:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:01,299 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-12-03 15:22:01,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:22:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-12-03 15:22:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:22:01,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:01,303 INFO L402 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-12-03 15:22:01,303 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:01,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 14 times [2018-12-03 15:22:01,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 15:22:01,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:01,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:01,681 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,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,681 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:22:01,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:01,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:01,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:22:01,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:01,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 15:22:02,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 15:22:02,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:02,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-12-03 15:22:02,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:02,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:22:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:22:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:22:02,223 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-12-03 15:22:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,372 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-12-03 15:22:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:22:02,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-12-03 15:22:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,374 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:22:02,374 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:22:02,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:22:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:22:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-12-03 15:22:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:22:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-12-03 15:22:02,396 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-12-03 15:22:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,397 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-12-03 15:22:02,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:22:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-12-03 15:22:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:22:02,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,399 INFO L402 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-12-03 15:22:02,399 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 15 times [2018-12-03 15:22:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 15:22:02,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:02,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:02,581 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:02,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,581 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:22:02,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:02,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:02,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:02,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:02,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 15:22:02,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 15:22:02,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:02,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-12-03 15:22:02,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:02,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:22:02,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:22:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:22:02,925 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-12-03 15:22:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:03,015 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-03 15:22:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:22:03,016 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-12-03 15:22:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:03,017 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:22:03,017 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:22:03,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:22:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:22:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 15:22:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:22:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 15:22:03,040 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-12-03 15:22:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:03,040 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 15:22:03,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:22:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 15:22:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:22:03,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:03,042 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 15:22:03,042 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 16 times [2018-12-03 15:22:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:22:03,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:03,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:03,460 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:03,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,460 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:22:03,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:03,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:22:03,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:22:03,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:03,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 15:22:03,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:03,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:22:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:22:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:22:03,766 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-12-03 15:22:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:03,872 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 15:22:03,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:22:03,873 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-12-03 15:22:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:03,874 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:22:03,874 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:22:03,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:22:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:22:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 15:22:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:22:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 15:22:03,898 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 15:22:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:03,899 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 15:22:03,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:22:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 15:22:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:22:03,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:03,900 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 15:22:03,901 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:03,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2018-12-03 15:22:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:22:04,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:04,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:04,140 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:04,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,141 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:04,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:04,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:04,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:22:04,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:04,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:22:04,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:22:04,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:04,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 15:22:04,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:04,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:22:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:22:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:22:04,553 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-12-03 15:22:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:04,707 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 15:22:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:22:04,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-12-03 15:22:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:04,708 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:22:04,708 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:22:04,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:22:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:22:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 15:22:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:22:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 15:22:04,736 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 15:22:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:04,736 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 15:22:04,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:22:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 15:22:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:22:04,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:04,738 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 15:22:04,738 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:04,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:04,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2018-12-03 15:22:04,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:22:05,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:05,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:05,041 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:05,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,041 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:05,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:05,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:05,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:05,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:05,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:22:05,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:22:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:22:05,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:05,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:22:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:22:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:22:05,438 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-12-03 15:22:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,519 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 15:22:05,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:22:05,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-12-03 15:22:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,520 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:22:05,520 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:22:05,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:22:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:22:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 15:22:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:22:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 15:22:05,551 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 15:22:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,551 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 15:22:05,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:22:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 15:22:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:22:05,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,553 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 15:22:05,553 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2018-12-03 15:22:05,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:22:11,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:11,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-12-03 15:22:11,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:11,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 15:22:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 15:22:11,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:22:11,759 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-12-03 15:22:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:14,189 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-12-03 15:22:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:22:14,189 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-12-03 15:22:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:14,190 INFO L225 Difference]: With dead ends: 5119 [2018-12-03 15:22:14,190 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:22:14,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:22:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:22:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:22:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:22:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:22:14,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-12-03 15:22:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:14,201 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:22:14,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 15:22:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:22:14,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:22:14,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:22:19,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:19,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:19,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:19,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:20,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:21,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:21,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:21,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:21,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:21,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:21,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:22,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:23,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:24,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:25,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:26,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:26,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:26,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:26,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:27,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:27,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:27,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:27,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:27,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:28,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:28,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:28,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:28,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:28,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:28,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:29,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:29,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:29,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:30,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:30,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:30,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:30,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:31,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:32,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:33,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:35,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:35,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:35,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:36,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:36,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:36,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:36,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:36,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:37,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:38,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:39,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:39,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:39,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:40,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:40,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:41,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:41,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:42,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:42,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:43,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:43,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:43,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:43,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:44,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:44,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:44,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:45,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:45,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:45,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:45,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:45,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:46,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:46,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:47,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:47,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:47,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:48,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:48,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:51,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:51,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:52,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:52,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:53,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:53,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:54,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:54,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:54,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:54,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:56,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:56,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:56,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:56,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:57,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:57,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:57,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:57,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:58,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:59,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:59,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:00,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:01,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:01,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:03,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:03,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:03,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:04,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:05,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:06,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:06,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:12,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:13,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:14,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:15,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:16,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:17,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:17,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:17,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:22,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:22,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:22,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:22,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:24,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:26,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:28,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:29,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:30,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:30,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:32,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:32,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:35,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:42,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:23:50,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:03,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:24:07,755 WARN L180 SmtUtils]: Spent 1.89 m on a formula simplification. DAG size of input: 5095 DAG size of output: 2491 [2018-12-03 15:24:08,743 WARN L180 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-12-03 15:26:13,873 WARN L180 SmtUtils]: Spent 2.09 m on a formula simplification. DAG size of input: 2491 DAG size of output: 362 [2018-12-03 15:26:20,372 WARN L180 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-12-03 15:26:20,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-12-03 15:26:20,379 INFO L444 ceAbstractionStarter]: At program point L64(lines 49 65) the Hoare annotation is: (let ((.cse38 (<= ULTIMATE.start_main_~j~5 2)) (.cse31 (<= ULTIMATE.start_main_~j~5 6)) (.cse13 (<= ULTIMATE.start_main_~j~5 5)) (.cse17 (<= ULTIMATE.start_main_~j~5 7)) (.cse6 (<= ULTIMATE.start_main_~j~5 9)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse7 (<= ULTIMATE.start_main_~j~5 3)) (.cse37 (<= ULTIMATE.start_main_~j~5 1)) (.cse29 (<= ULTIMATE.start_main_~j~5 4)) (.cse36 (<= ULTIMATE.start_main_~j~5 8)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse22 (<= 40 ULTIMATE.start_main_~k~5)) (.cse26 (<= 60 ULTIMATE.start_main_~k~5)) (.cse27 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse23 (<= 70 ULTIMATE.start_main_~k~5)) (.cse12 (and .cse36 .cse4)) (.cse32 (<= 50 ULTIMATE.start_main_~k~5)) (.cse28 (and .cse29 .cse4)) (.cse21 (and .cse37 .cse4)) (.cse25 (<= 80 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 7)) (.cse2 (<= ULTIMATE.start_main_~i~5 4)) (.cse10 (and .cse7 .cse4)) (.cse24 (and .cse4 .cse39)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse16 (and .cse4 .cse6)) (.cse11 (<= ULTIMATE.start_main_~i~5 8)) (.cse14 (and .cse17 .cse4)) (.cse9 (<= ULTIMATE.start_main_~i~5 3)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse8 (<= ULTIMATE.start_main_~i~5 0)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse1 (and .cse13 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 6)) (.cse20 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse33 (and .cse31 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse19 (<= ULTIMATE.start_main_~i~5 5)) (.cse34 (and .cse4 .cse38))) (or (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse6) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse7 .cse4 .cse8) (and .cse0 .cse9 .cse10 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 (<= 88 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse13 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse15 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse10 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse0 .cse16 .cse9 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse8) (and .cse0 .cse1 .cse18 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 57 ULTIMATE.start_main_~k~5) .cse14) (and (and .cse20 .cse21) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse22 .cse9 .cse4) (and .cse0 .cse4 .cse6 (<= 9 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse23 .cse15 .cse4) (and .cse0 .cse11 .cse24 .cse25) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse21 .cse15) (and .cse0 .cse17 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and (and .cse20 .cse4) (<= 100 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 .cse24 .cse15) (and .cse0 .cse22 .cse24 .cse2) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse20 .cse12)) (and .cse0 .cse11 .cse27 .cse4) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse12 .cse18) (and .cse0 .cse10 (<= 73 ULTIMATE.start_main_~k~5) .cse18) (and .cse0 (<= 34 ULTIMATE.start_main_~k~5) .cse9 .cse28) (and .cse0 .cse19 .cse26 .cse4) (and .cse0 (<= 38 ULTIMATE.start_main_~k~5) .cse9 .cse12) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse14 .cse18) (and .cse0 .cse29 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse6) (and .cse0 .cse31 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse8) (and (and .cse20 .cse10) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse21 .cse18) (and .cse27 (and .cse20 .cse24)) (and .cse0 .cse16 (<= 69 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse32 .cse4 .cse2) (and .cse0 .cse9 .cse1 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 (<= 54 ULTIMATE.start_main_~k~5) .cse19) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse19 .cse33) (and (<= 92 ULTIMATE.start_main_~k~5) (and .cse20 .cse34)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse33 .cse18) (and .cse0 .cse2 .cse16 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse14 (<= 47 ULTIMATE.start_main_~k~5) .cse2) (and (<= 99 ULTIMATE.start_main_~k~5) (and .cse20 .cse16)) (and .cse0 .cse30 .cse4 .cse35) (and .cse0 .cse31 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse12 .cse15 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse36 .cse4 .cse5) (and .cse0 .cse34 .cse15 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse8) (and .cse0 (<= 41 ULTIMATE.start_main_~k~5) .cse21 .cse2) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse34 .cse18) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse5) (and .cse0 .cse29 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse38) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and .cse0 .cse10 .cse15 (<= 63 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse28 .cse18) (and .cse0 (<= 64 ULTIMATE.start_main_~k~5) .cse28 .cse15) (and .cse0 .cse11 (<= 82 ULTIMATE.start_main_~k~5) .cse34) (and .cse0 .cse19 (<= 51 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse36 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse9 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse33 (<= 66 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse23 .cse24 .cse18) (and .cse0 .cse33 .cse9 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse34 (<= 42 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse19 .cse12 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 55 ULTIMATE.start_main_~k~5) .cse1) (and (and .cse20 .cse1) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 .cse2 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 48 ULTIMATE.start_main_~k~5) .cse2 .cse12) (and .cse0 .cse11 (<= 84 ULTIMATE.start_main_~k~5) .cse28) (and .cse0 .cse11 .cse33 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse31 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse30 (<= 28 ULTIMATE.start_main_~k~5) .cse36 .cse4) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse8) (and .cse0 .cse32 .cse19 .cse24) (and .cse0 .cse11 (<= 89 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse20 .cse14) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse29 .cse30 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse16 (<= 79 ULTIMATE.start_main_~k~5) .cse18) (and (and .cse20 .cse28) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse38 .cse8) (and .cse0 .cse10 (<= 43 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse11 .cse1 (<= 85 ULTIMATE.start_main_~k~5)) (and .cse0 .cse9 .cse21 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse7 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse11 (<= 81 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 .cse4 .cse25 .cse18) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse33 .cse2) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse19 .cse10) (and .cse0 .cse24 .cse9 .cse35) (and .cse0 .cse13 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse7 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and .cse0 .cse19 .cse16 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse14 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse4 .cse38 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse9 .cse34) (and .cse0 .cse40 .cse4 .cse8) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse37 .cse4) (and .cse0 (<= 65 ULTIMATE.start_main_~k~5) .cse1 .cse15) (and (and .cse20 .cse33) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 .cse34 (<= 52 ULTIMATE.start_main_~k~5))))) [2018-12-03 15:26:20,380 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-12-03 15:26:20,380 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-12-03 15:26:20,380 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-12-03 15:26:20,380 INFO L444 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-12-03 15:26:20,380 INFO L444 ceAbstractionStarter]: At program point L70(lines 33 70) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-12-03 15:26:20,419 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:26:20 BoogieIcfgContainer [2018-12-03 15:26:20,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:26:20,420 INFO L168 Benchmark]: Toolchain (without parser) took 268670.63 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -536.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:26:20,421 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:26:20,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 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:26:20,422 INFO L168 Benchmark]: Boogie Preprocessor took 25.37 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:26:20,423 INFO L168 Benchmark]: RCFGBuilder took 356.18 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:26:20,423 INFO L168 Benchmark]: TraceAbstraction took 268243.25 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -557.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:26:20,427 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.19 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 39.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.37 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 356.18 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 268243.25 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -557.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 4) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 3 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 3) && 39 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && main_~i~5 <= 6) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5) && 100 <= main_~k~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 4)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 34 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 60 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 38 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 54 <= main_~k~5) && main_~i~5 <= 5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (92 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 9) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (99 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 64 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 3) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 3) && 36 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 42 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || (((10 <= main_~n~5 && 48 <= main_~k~5) && main_~i~5 <= 4) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 6) && 26 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 28 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 43 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 3) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 9) && 59 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 2) && 22 <= main_~k~5)) || (((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 268.1s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 246.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 400 SDslu, 431 SDs, 0 SdLazy, 658 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1625 GetRequests, 1178 SyntacticMatches, 61 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1940 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2339026 FormulaSimplificationTreeSizeReduction, 114.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 391445 FormulaSimplificationTreeSizeReductionInter, 131.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 791047 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3453 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 14938/59577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...