java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:19:26,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:19:26,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:19:26,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:19:26,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:19:26,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:19:26,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:19:26,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:19:26,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:19:26,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:19:26,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:19:26,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:19:26,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:19:26,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:19:26,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:19:26,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:19:26,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:19:26,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:19:26,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:19:26,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:19:26,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:19:26,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:19:26,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:19:26,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:19:26,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:19:26,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:19:26,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:19:26,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:19:26,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:19:26,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:19:26,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:19:26,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:19:26,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:19:26,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:19:26,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:19:26,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:19:26,926 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:19:26,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:19:26,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:19:26,942 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:19:26,942 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:19:26,942 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:19:26,943 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:19:26,943 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:19:26,943 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:19:26,943 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:19:26,943 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:19:26,944 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:19:26,944 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:19:26,944 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:19:26,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:19:26,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:19:26,945 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:19:26,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:19:26,946 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:19:26,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:19:26,946 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:19:26,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:19:26,946 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:19:26,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:19:26,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:19:26,947 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:19:26,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:19:26,947 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:19:26,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:19:26,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:19:26,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:19:26,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:19:26,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:19:26,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:19:26,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:19:26,949 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:19:26,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:19:26,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:19:26,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:19:26,950 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:19:26,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:19:27,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:19:27,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:19:27,028 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:19:27,028 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:19:27,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-12-03 18:19:27,030 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-12-03 18:19:27,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:19:27,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:19:27,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:19:27,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:19:27,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:19:27,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,100 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:19:27,100 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:19:27,101 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:19:27,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:19:27,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:19:27,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:19:27,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:19:27,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/1) ... [2018-12-03 18:19:27,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:19:27,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:19:27,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:19:27,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:19:27,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (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 18:19:27,226 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:19:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:19:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:19:27,456 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:19:27,456 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:19:27,457 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:19:27 BoogieIcfgContainer [2018-12-03 18:19:27,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:19:27,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:19:27,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:19:27,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:19:27,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:27" (1/2) ... [2018-12-03 18:19:27,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5ffacd and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:19:27, skipping insertion in model container [2018-12-03 18:19:27,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:19:27" (2/2) ... [2018-12-03 18:19:27,471 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-12-03 18:19:27,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:19:27,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:19:27,515 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:19:27,554 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:19:27,554 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:19:27,554 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:19:27,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:19:27,555 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:19:27,555 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:19:27,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:19:27,556 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:19:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 18:19:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 18:19:27,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:27,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 18:19:27,585 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:27,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:27,593 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-12-03 18:19:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:27,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:27,735 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 18:19:27,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:19:27,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 18:19:27,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:19:27,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:19:27,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:19:27,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:19:27,760 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 18:19:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:27,817 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:19:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:19:27,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 18:19:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:27,830 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:19:27,831 INFO L226 Difference]: Without dead ends: 4 [2018-12-03 18:19:27,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:19:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-12-03 18:19:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-12-03 18:19:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 18:19:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-03 18:19:27,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-12-03 18:19:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:27,871 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-12-03 18:19:27,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:19:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-03 18:19:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:19:27,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:27,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:19:27,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:27,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-12-03 18:19:27,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:27,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:27,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:27,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:27,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:28,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:28,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:28,006 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-03 18:19:28,014 INFO L205 CegarAbsIntRunner]: [0], [4], [6] [2018-12-03 18:19:28,104 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:19:28,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:19:28,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:19:28,441 INFO L272 AbstractInterpreter]: Visited 3 different actions 23 times. Merged at 2 different actions 15 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:19:28,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:28,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:19:28,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:28,457 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 18:19:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:28,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:28,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:28,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:28,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:28,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2018-12-03 18:19:28,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:28,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:19:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:19:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:19:28,663 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-12-03 18:19:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:28,686 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-03 18:19:28,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:19:28,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-12-03 18:19:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:28,687 INFO L225 Difference]: With dead ends: 6 [2018-12-03 18:19:28,687 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:19:28,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:19:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:19:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:19:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:19:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:19:28,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:19:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:28,692 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:19:28,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:19:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:19:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:19:28,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:28,694 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-12-03 18:19:28,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:28,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:28,694 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-12-03 18:19:28,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:28,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:28,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:28,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:28,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:28,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:28,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:28,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:28,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:28,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:28,759 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 18:19:28,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:28,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:28,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:19:28,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:28,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:28,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:29,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:29,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-03 18:19:29,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:19:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:19:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:19:29,174 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-12-03 18:19:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:29,259 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-03 18:19:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:19:29,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-12-03 18:19:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:29,262 INFO L225 Difference]: With dead ends: 7 [2018-12-03 18:19:29,262 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:19:29,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:19:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:19:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:19:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:19:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:19:29,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:19:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:29,266 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:19:29,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:19:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:19:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:19:29,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:29,268 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-12-03 18:19:29,268 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:29,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-12-03 18:19:29,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:29,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:29,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:29,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:29,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:29,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:29,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:29,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:29,365 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 18:19:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:29,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:29,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:29,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:29,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:29,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-03 18:19:29,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:29,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:19:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:19:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:19:29,735 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-12-03 18:19:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:29,790 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:19:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:19:29,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-03 18:19:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:29,791 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:19:29,791 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:19:29,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:19:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:19:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:19:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:19:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:19:29,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:19:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:29,797 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:19:29,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:19:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:19:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:19:29,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:29,798 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-12-03 18:19:29,798 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:29,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-12-03 18:19:29,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:29,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:29,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:29,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:29,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:29,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:29,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:29,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:29,936 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 18:19:29,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:29,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:29,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:30,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:30,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:30,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-03 18:19:30,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:30,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:19:30,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:19:30,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:19:30,619 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-12-03 18:19:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:30,680 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:19:30,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:19:30,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-03 18:19:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:30,683 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:19:30,683 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:19:30,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:19:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:19:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:19:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:19:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:19:30,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:19:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:30,688 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:19:30,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:19:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:19:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:19:30,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:30,689 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-12-03 18:19:30,689 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:30,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-12-03 18:19:30,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:30,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:30,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:30,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:30,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:30,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:30,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:30,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:30,913 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 18:19:30,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:30,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:30,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:19:30,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:30,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:31,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:31,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:31,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-03 18:19:31,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:31,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:19:31,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:19:31,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:19:31,226 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-12-03 18:19:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:31,315 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:19:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:19:31,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-12-03 18:19:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:31,317 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:19:31,317 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:19:31,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:19:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:19:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:19:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:19:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:19:31,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:19:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:31,323 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:19:31,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:19:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:19:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:19:31,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:31,324 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-12-03 18:19:31,324 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-12-03 18:19:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:31,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:31,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:31,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:31,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:31,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:31,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:31,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:31,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:19:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:31,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:31,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:31,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:31,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:31,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:32,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:32,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2018-12-03 18:19:32,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:32,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:19:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:19:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:19:32,042 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-12-03 18:19:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:32,156 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:19:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:19:32,156 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-12-03 18:19:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:32,157 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:19:32,158 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:19:32,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:19:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:19:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:19:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:19:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:19:32,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:19:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:32,163 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:19:32,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:19:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:19:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:19:32,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:32,164 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-12-03 18:19:32,164 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:32,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:32,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-12-03 18:19:32,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:32,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:32,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:32,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:32,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:32,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:32,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:32,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:32,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:32,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:32,473 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 18:19:32,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:32,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:32,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:33,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:33,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:33,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2018-12-03 18:19:33,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:33,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:19:33,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:19:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:19:33,495 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-12-03 18:19:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:33,653 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:19:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:19:33,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-12-03 18:19:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:33,656 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:19:33,656 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:19:33,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:19:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:19:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:19:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:19:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:19:33,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:19:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:33,661 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:19:33,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:19:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:19:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:19:33,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:33,662 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-12-03 18:19:33,662 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:33,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-12-03 18:19:33,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:33,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:33,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:33,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:33,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:33,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:33,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:33,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:33,874 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 18:19:33,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:33,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:33,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:19:33,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:33,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:34,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:34,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2018-12-03 18:19:34,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:34,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:19:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:19:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:19:34,820 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-12-03 18:19:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:34,967 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:19:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:19:34,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-12-03 18:19:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:34,969 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:19:34,969 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:19:34,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:19:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:19:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:19:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:19:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:19:34,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:19:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:34,976 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:19:34,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:19:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:19:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:19:34,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:34,977 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-12-03 18:19:34,977 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:34,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:34,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-12-03 18:19:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:34,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:34,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:35,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:35,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:35,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:35,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:35,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:35,190 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 18:19:35,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:35,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:35,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:35,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:35,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:35,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:36,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:36,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2018-12-03 18:19:36,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:36,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:19:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:19:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:19:36,099 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-12-03 18:19:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:36,238 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:19:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:19:36,239 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-12-03 18:19:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:36,240 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:19:36,240 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:19:36,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:19:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:19:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:19:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:19:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:19:36,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:19:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:36,245 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:19:36,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:19:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:19:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:19:36,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:36,246 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-12-03 18:19:36,247 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:36,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-12-03 18:19:36,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:36,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:36,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:36,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:36,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:36,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:36,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:36,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:36,601 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 18:19:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:36,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:36,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:36,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:37,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:37,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2018-12-03 18:19:37,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:37,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:19:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:19:37,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:19:37,422 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-12-03 18:19:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:38,015 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:19:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:19:38,016 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-12-03 18:19:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:38,017 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:19:38,017 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:19:38,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:19:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:19:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:19:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:19:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:19:38,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 18:19:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:38,024 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:19:38,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:19:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:19:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:19:38,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:38,025 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-12-03 18:19:38,025 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:38,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-12-03 18:19:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:38,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:38,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:38,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:38,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:38,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:38,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:38,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:38,269 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 18:19:38,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:38,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:38,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:19:38,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:38,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:39,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:39,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:39,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2018-12-03 18:19:39,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:39,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:19:39,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:19:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:19:39,594 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-12-03 18:19:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:39,917 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:19:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:19:39,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-12-03 18:19:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:39,918 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:19:39,918 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:19:39,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:19:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:19:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:19:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:19:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:19:39,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 18:19:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:39,923 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:19:39,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:19:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:19:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:19:39,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:39,924 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-12-03 18:19:39,925 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-12-03 18:19:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:39,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:39,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:39,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:39,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:40,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:40,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:40,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:40,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:40,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:40,328 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 18:19:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:40,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:40,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:40,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:40,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:41,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:41,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:41,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2018-12-03 18:19:41,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:41,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:19:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:19:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:19:41,820 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-12-03 18:19:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:42,295 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 18:19:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:19:42,295 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-12-03 18:19:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:42,296 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:19:42,296 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:19:42,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:19:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:19:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:19:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:19:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:19:42,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 18:19:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:42,303 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:19:42,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:19:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:19:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:19:42,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:42,304 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-12-03 18:19:42,304 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:42,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-12-03 18:19:42,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:42,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:42,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:43,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:43,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:43,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:43,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:43,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:43,450 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 18:19:43,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:43,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:43,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:43,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:44,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:44,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2018-12-03 18:19:44,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:44,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:19:44,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:19:44,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:19:44,436 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-12-03 18:19:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:44,784 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:19:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:19:44,785 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-12-03 18:19:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:44,786 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:19:44,786 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:19:44,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:19:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:19:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:19:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:19:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:19:44,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 18:19:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:44,792 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:19:44,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:19:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:19:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:19:44,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:44,793 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-12-03 18:19:44,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:44,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-12-03 18:19:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:44,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:45,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:45,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:45,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:45,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:45,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:45,151 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 18:19:45,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:45,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:45,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:19:45,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:45,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:45,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:46,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:46,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2018-12-03 18:19:46,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:46,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:19:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:19:46,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:19:46,932 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-12-03 18:19:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:47,325 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 18:19:47,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:19:47,326 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-12-03 18:19:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:47,327 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:19:47,327 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:19:47,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:19:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:19:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:19:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:19:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:19:47,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 18:19:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:47,334 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:19:47,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:19:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:19:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:19:47,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:47,334 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-12-03 18:19:47,335 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:47,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-12-03 18:19:47,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:47,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:47,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:47,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:47,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:47,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:47,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:47,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:47,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:47,903 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 18:19:47,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:47,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:47,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:47,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:47,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:48,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:49,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:49,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2018-12-03 18:19:49,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:49,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:19:49,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:19:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=1866, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:19:49,683 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-12-03 18:19:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:50,178 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:19:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:19:50,179 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-12-03 18:19:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:50,180 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:19:50,180 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:19:50,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=486, Invalid=1866, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:19:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:19:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:19:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:19:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:19:50,187 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 18:19:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:50,187 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:19:50,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:19:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:19:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:19:50,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:50,188 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-12-03 18:19:50,189 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:50,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-12-03 18:19:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:50,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:50,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:50,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:50,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:50,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:50,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:50,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:50,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:50,625 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 18:19:50,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:50,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:50,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:51,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:53,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:53,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2018-12-03 18:19:53,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:53,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:19:53,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:19:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:19:53,246 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-12-03 18:19:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:53,772 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 18:19:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:19:53,773 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-12-03 18:19:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:53,774 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:19:53,774 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:19:53,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:19:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:19:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:19:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:19:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:19:53,779 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 18:19:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:53,780 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:19:53,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:19:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:19:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:19:53,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:53,781 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-12-03 18:19:53,781 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:53,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-12-03 18:19:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:53,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:53,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:54,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:54,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:54,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:54,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:54,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:54,261 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 18:19:54,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:54,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:54,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:19:54,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:54,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:55,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:56,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:56,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2018-12-03 18:19:56,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:56,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:19:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:19:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=2369, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:19:56,146 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-12-03 18:19:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:56,642 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:19:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:19:56,643 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-12-03 18:19:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:56,643 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:19:56,644 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:19:56,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=601, Invalid=2369, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:19:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:19:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:19:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:19:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:19:56,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 18:19:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:56,651 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:19:56,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:19:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:19:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:19:56,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:56,652 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-12-03 18:19:56,652 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:56,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:56,652 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-12-03 18:19:56,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:56,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:57,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:57,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:57,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:57,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:57,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:57,233 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 18:19:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:57,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:57,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:57,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:57,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:58,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:59,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:59,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2018-12-03 18:19:59,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:59,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:19:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:19:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=2643, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:19:59,474 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-12-03 18:20:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:00,271 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 18:20:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:20:00,272 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-12-03 18:20:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:00,272 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:20:00,272 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:20:00,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=663, Invalid=2643, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:20:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:20:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:20:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:20:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:20:00,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 18:20:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:00,278 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:20:00,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:20:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:20:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:20:00,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:00,280 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-12-03 18:20:00,280 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:00,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:00,280 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-12-03 18:20:00,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:00,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:00,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:00,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:00,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:00,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:00,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:00,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:00,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 18:20:00,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:00,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:00,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:00,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:02,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2018-12-03 18:20:03,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:03,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:20:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:20:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:20:03,550 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-12-03 18:20:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:04,438 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:20:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:20:04,439 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-12-03 18:20:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:04,440 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:20:04,440 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:20:04,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:20:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:20:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:20:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:20:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:20:04,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 18:20:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:04,446 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:20:04,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:20:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:20:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:20:04,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:04,447 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-12-03 18:20:04,448 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:04,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-12-03 18:20:04,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:04,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:04,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:05,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:05,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:05,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:05,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:05,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:05,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:05,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:05,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 18:20:05,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:05,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:06,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:07,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:07,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2018-12-03 18:20:07,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:07,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:20:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:20:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=3236, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:20:07,953 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-12-03 18:20:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:09,050 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 18:20:09,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:20:09,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-12-03 18:20:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:09,052 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:20:09,052 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:20:09,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=796, Invalid=3236, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:20:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:20:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:20:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:20:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:20:09,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 18:20:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:09,059 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:20:09,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:20:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:20:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:20:09,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:09,060 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-12-03 18:20:09,060 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:09,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-12-03 18:20:09,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:09,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:09,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:09,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:09,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:09,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:09,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:09,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:09,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:09,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:09,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:09,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:09,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:11,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:12,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2018-12-03 18:20:12,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:12,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:20:12,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:20:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:20:12,822 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-12-03 18:20:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:13,727 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:20:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:20:13,728 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-12-03 18:20:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:13,729 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:20:13,729 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:20:13,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:20:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:20:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:20:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:20:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:20:13,735 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 18:20:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:20:13,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:20:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:20:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:20:13,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:13,736 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-12-03 18:20:13,736 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:13,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-12-03 18:20:13,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:13,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:13,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:14,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:14,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:14,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:14,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:14,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:14,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:14,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:14,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:16,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:18,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:18,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2018-12-03 18:20:18,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:18,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:20:18,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:20:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=3889, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:20:18,173 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-12-03 18:20:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:19,172 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 18:20:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:20:19,173 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-12-03 18:20:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:19,174 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:20:19,174 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:20:19,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=941, Invalid=3889, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:20:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:20:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:20:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:20:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:20:19,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 18:20:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:19,180 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:20:19,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:20:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:20:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:20:19,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:19,181 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-12-03 18:20:19,181 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:19,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-12-03 18:20:19,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:19,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:19,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:20,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:20,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:20,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:20,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:20,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:20,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:20,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:20,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:20,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:20:20,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:20,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:22,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:24,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2018-12-03 18:20:24,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:24,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:20:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:20:24,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=4238, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:20:24,352 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-12-03 18:20:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:25,325 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:20:25,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:20:25,326 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-12-03 18:20:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:25,326 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:20:25,326 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:20:25,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1018, Invalid=4238, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:20:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:20:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:20:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:20:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:20:25,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 18:20:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:25,332 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:20:25,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:20:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:20:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:20:25,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:25,333 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-12-03 18:20:25,333 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:25,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-12-03 18:20:25,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:25,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:25,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:26,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:26,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:26,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:26,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:26,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:26,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:26,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:26,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:26,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:26,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:26,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:28,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:30,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:30,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2018-12-03 18:20:30,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:30,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:20:30,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:20:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1098, Invalid=4602, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:20:30,401 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-12-03 18:20:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:31,617 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 18:20:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:20:31,618 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-12-03 18:20:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:31,619 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:20:31,619 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:20:31,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1098, Invalid=4602, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:20:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:20:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:20:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:20:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:20:31,627 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 18:20:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:31,627 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:20:31,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:20:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:20:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:20:31,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:31,628 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-12-03 18:20:31,628 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:31,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-12-03 18:20:31,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:31,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:31,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:32,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:32,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:32,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:32,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:32,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:32,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:32,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:32,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:32,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:34,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:36,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:36,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2018-12-03 18:20:36,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:36,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:20:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:20:36,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=4981, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:20:36,949 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-12-03 18:20:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:38,027 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:20:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:20:38,027 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-12-03 18:20:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:38,028 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:20:38,028 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:20:38,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1181, Invalid=4981, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:20:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:20:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:20:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:20:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:20:38,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 18:20:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:38,035 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:20:38,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:20:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:20:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:20:38,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:38,036 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-12-03 18:20:38,036 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:38,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-12-03 18:20:38,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:38,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:38,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:39,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:39,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:39,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:39,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:39,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:39,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:39,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:39,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:20:39,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:39,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:41,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:43,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:43,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2018-12-03 18:20:43,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:43,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:20:43,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:20:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=5375, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:20:43,878 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-12-03 18:20:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:45,490 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 18:20:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:20:45,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-12-03 18:20:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:45,494 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:20:45,494 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:20:45,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1267, Invalid=5375, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:20:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:20:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:20:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:20:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:20:45,498 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 18:20:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:45,498 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:20:45,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:20:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:20:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:20:45,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:45,499 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-12-03 18:20:45,499 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:45,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-12-03 18:20:45,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:45,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:45,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:45,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:47,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:47,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:47,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:47,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:47,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:47,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:47,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:47,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:47,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:47,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:49,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:52,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2018-12-03 18:20:52,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:52,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:20:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:20:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1356, Invalid=5784, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:20:52,425 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-12-03 18:20:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:54,027 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:20:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:20:54,028 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-12-03 18:20:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:54,029 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:20:54,029 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:20:54,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1356, Invalid=5784, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:20:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:20:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:20:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:20:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:20:54,034 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 18:20:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:54,035 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:20:54,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:20:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:20:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:20:54,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:54,036 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-12-03 18:20:54,036 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:54,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-12-03 18:20:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:54,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:54,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:55,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:55,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:55,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:55,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:55,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:55,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:55,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:55,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:55,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:58,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:00,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:00,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2018-12-03 18:21:00,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:00,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:21:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:21:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1448, Invalid=6208, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:21:00,941 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-12-03 18:21:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:02,693 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 18:21:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:21:02,693 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-12-03 18:21:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:02,694 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:21:02,694 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:21:02,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1448, Invalid=6208, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:21:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:21:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:21:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:21:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:21:02,701 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 18:21:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:02,701 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:21:02,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:21:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:21:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:21:02,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:02,702 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-12-03 18:21:02,702 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:02,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-12-03 18:21:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:02,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:02,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:04,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:04,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:04,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:04,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:04,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:04,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:04,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:21:04,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:21:04,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:21:04,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:04,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:07,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:10,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:10,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2018-12-03 18:21:10,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:10,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:21:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:21:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=6647, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:21:10,431 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-12-03 18:21:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:12,357 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:21:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:21:12,357 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-12-03 18:21:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:12,358 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:21:12,358 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:21:12,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1543, Invalid=6647, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:21:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:21:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:21:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:21:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:21:12,364 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 18:21:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:12,365 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:21:12,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:21:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:21:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:21:12,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:12,365 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-12-03 18:21:12,365 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:12,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-12-03 18:21:12,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:12,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:12,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:12,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:13,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:13,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:13,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:13,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:13,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:13,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:13,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:13,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:13,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:13,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:13,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:17,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:20,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:20,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2018-12-03 18:21:20,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:20,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:21:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:21:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=7101, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:21:20,548 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-12-03 18:21:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:22,781 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 18:21:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:21:22,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-12-03 18:21:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:22,782 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:21:22,782 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:21:22,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1641, Invalid=7101, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:21:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:21:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:21:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:21:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:21:22,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 18:21:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:22,788 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:21:22,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:21:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:21:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:21:22,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:22,789 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-12-03 18:21:22,789 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:22,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-12-03 18:21:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:22,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:22,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:24,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:24,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:24,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:24,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:24,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:24,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:24,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:24,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:21:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:24,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:28,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:31,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:31,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2018-12-03 18:21:31,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:31,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:21:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:21:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=7570, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 18:21:31,715 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-12-03 18:21:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:33,612 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:21:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:21:33,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-12-03 18:21:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:33,614 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:21:33,614 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:21:33,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1742, Invalid=7570, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 18:21:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:21:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:21:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:21:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:21:33,618 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 18:21:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:33,619 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:21:33,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:21:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:21:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:21:33,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:33,619 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-12-03 18:21:33,619 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:33,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-12-03 18:21:33,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:33,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:33,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:33,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:35,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:35,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:35,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:35,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:35,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:35,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:35,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:21:35,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:21:35,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 18:21:35,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:35,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:39,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:43,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:43,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2018-12-03 18:21:43,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:43,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:21:43,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:21:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1846, Invalid=8054, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:21:43,764 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-12-03 18:21:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:46,091 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 18:21:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:21:46,091 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-12-03 18:21:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:46,092 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:21:46,092 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:21:46,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1846, Invalid=8054, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:21:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:21:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:21:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:21:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:21:46,100 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 18:21:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:46,100 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:21:46,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:21:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:21:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:21:46,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:46,101 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-12-03 18:21:46,101 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:46,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-12-03 18:21:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:46,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:46,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:48,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:48,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:48,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:48,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:48,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:48,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:48,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:48,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:48,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:48,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:48,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:52,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:56,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:56,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2018-12-03 18:21:56,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:56,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:21:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:21:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=8553, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:21:56,909 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-12-03 18:21:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:59,759 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:21:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:21:59,759 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-12-03 18:21:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:59,760 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:21:59,760 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:21:59,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1953, Invalid=8553, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:21:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:21:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:21:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:21:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:21:59,766 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 18:21:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:59,766 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:21:59,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:21:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:21:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:21:59,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:59,767 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-12-03 18:21:59,767 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:59,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-12-03 18:21:59,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:59,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:59,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:59,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:59,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:01,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:01,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:01,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:01,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:01,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:22:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:01,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:06,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:11,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:11,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2018-12-03 18:22:11,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:22:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:22:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2063, Invalid=9067, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:22:11,179 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-12-03 18:22:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:13,843 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 18:22:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:22:13,843 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-12-03 18:22:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:13,844 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:22:13,844 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:22:13,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2975 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2063, Invalid=9067, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:22:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:22:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:22:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:22:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:22:13,850 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 18:22:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:13,850 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:22:13,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:22:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:22:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:22:13,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:13,850 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-12-03 18:22:13,850 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:13,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-12-03 18:22:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:13,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:16,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:16,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:16,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:16,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:16,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:16,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:16,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:22:16,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:22:16,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 18:22:16,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:16,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:21,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:26,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:26,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2018-12-03 18:22:26,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:26,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 18:22:26,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 18:22:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2176, Invalid=9596, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 18:22:26,325 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-12-03 18:22:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:29,364 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:22:29,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:22:29,365 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-12-03 18:22:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:29,366 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:22:29,366 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:22:29,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2176, Invalid=9596, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 18:22:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:22:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:22:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:22:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:22:29,372 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 18:22:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:29,372 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:22:29,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 18:22:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:22:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:22:29,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:29,373 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-12-03 18:22:29,373 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:29,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-12-03 18:22:29,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:29,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:29,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:31,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:31,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:31,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:31,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:31,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:31,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:31,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:22:31,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:22:31,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:22:31,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:31,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:37,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:43,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:43,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2018-12-03 18:22:43,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:43,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 18:22:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 18:22:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2292, Invalid=10140, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:22:43,270 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-12-03 18:22:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:46,805 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 18:22:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:22:46,805 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-12-03 18:22:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:46,806 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:22:46,806 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:22:46,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=2292, Invalid=10140, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:22:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:22:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:22:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:22:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:22:46,813 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 18:22:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:46,813 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:22:46,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 18:22:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:22:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:22:46,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:46,814 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-12-03 18:22:46,814 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:46,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:46,814 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-12-03 18:22:46,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:46,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:46,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:46,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:46,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:49,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:49,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:49,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:49,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:49,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:49,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:49,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:49,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:22:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:49,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:55,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:00,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:00,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2018-12-03 18:23:00,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:00,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 18:23:00,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 18:23:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2411, Invalid=10699, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:23:00,928 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-12-03 18:23:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:04,489 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:23:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:23:04,489 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-12-03 18:23:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:04,490 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:23:04,490 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:23:04,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3515 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=2411, Invalid=10699, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:23:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:23:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:23:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:23:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:23:04,496 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 18:23:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:04,496 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:23:04,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 18:23:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:23:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:23:04,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:04,496 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-12-03 18:23:04,497 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:04,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-12-03 18:23:04,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:04,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:04,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:04,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:04,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:07,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:07,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:07,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:07,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:07,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:07,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:23:07,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:23:07,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:23:07,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:07,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:13,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:19,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:19,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2018-12-03 18:23:19,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:19,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:23:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:23:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2533, Invalid=11273, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:23:19,816 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-12-03 18:23:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:23,580 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 18:23:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:23:23,581 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-12-03 18:23:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:23,581 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:23:23,581 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:23:23,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3705 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2533, Invalid=11273, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:23:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:23:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:23:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:23:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:23:23,587 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 18:23:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:23,588 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:23:23,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:23:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:23:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:23:23,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:23,588 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-12-03 18:23:23,589 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:23,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-12-03 18:23:23,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:23,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:23,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:23,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:23,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:26,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:26,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:26,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:26,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:26,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:26,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:26,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:23:26,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:23:26,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:23:26,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:26,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:33,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:39,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:39,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2018-12-03 18:23:39,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:39,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 18:23:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 18:23:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2658, Invalid=11862, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 18:23:39,766 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-12-03 18:23:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:43,892 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:23:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:23:43,892 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-12-03 18:23:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:43,893 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:23:43,893 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:23:43,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3900 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=2658, Invalid=11862, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 18:23:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:23:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:23:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:23:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:23:43,899 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 18:23:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:43,900 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:23:43,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 18:23:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:23:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:23:43,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:43,901 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-12-03 18:23:43,901 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:43,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-12-03 18:23:43,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:43,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:43,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:43,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:43,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:47,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:47,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:47,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:47,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:47,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:47,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:47,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:47,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:23:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:47,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:54,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:01,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2018-12-03 18:24:01,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:01,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 18:24:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 18:24:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=12466, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:24:01,288 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-12-03 18:24:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:05,879 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 18:24:05,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:24:05,879 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-12-03 18:24:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:05,880 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:24:05,880 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:24:05,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4100 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=2786, Invalid=12466, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:24:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:24:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:24:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:24:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:24:05,886 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 18:24:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:05,886 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:24:05,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 18:24:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:24:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:24:05,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:05,887 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-12-03 18:24:05,887 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-12-03 18:24:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:05,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:05,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:05,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:05,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:09,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:09,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:09,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:09,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:09,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:09,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:09,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:24:09,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:24:09,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:24:09,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:09,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:16,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:24,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:24,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2018-12-03 18:24:24,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:24,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:24:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:24:24,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2917, Invalid=13085, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 18:24:24,647 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-12-03 18:24:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:29,604 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:24:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:24:29,604 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-12-03 18:24:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:29,605 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:24:29,605 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:24:29,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=2917, Invalid=13085, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 18:24:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:24:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:24:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:24:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:24:29,611 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 18:24:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:29,611 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:24:29,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:24:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:24:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:24:29,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:29,611 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-12-03 18:24:29,612 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:29,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-12-03 18:24:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:29,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:29,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:33,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:33,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:33,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:33,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:33,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:33,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:33,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:24:33,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:24:33,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:24:33,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:33,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:41,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:50,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:50,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2018-12-03 18:24:50,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:50,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 18:24:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 18:24:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3051, Invalid=13719, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:24:50,269 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-12-03 18:24:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:54,999 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 18:24:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:24:54,999 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-12-03 18:24:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:55,000 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:24:55,000 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:24:55,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4515 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=3051, Invalid=13719, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:24:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:24:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:24:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:24:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 18:24:55,006 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 18:24:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:55,007 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 18:24:55,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 18:24:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 18:24:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:24:55,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:55,007 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-12-03 18:24:55,007 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:55,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-12-03 18:24:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:55,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:55,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:55,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:58,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:58,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:58,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:58,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:58,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:58,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:58,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:58,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:24:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:58,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:07,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:16,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:16,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2018-12-03 18:25:16,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:16,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 18:25:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 18:25:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3188, Invalid=14368, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 18:25:16,272 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. [2018-12-03 18:25:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:21,867 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 18:25:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:25:21,868 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 45 [2018-12-03 18:25:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:21,869 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:25:21,869 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:25:21,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4730 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=3188, Invalid=14368, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 18:25:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:25:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:25:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:25:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 18:25:21,874 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 18:25:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:21,874 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 18:25:21,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 18:25:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 18:25:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:25:21,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:21,875 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-12-03 18:25:21,875 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:21,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-12-03 18:25:21,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:21,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:25,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:25,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:25,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:25,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:25,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:25,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:26,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:25:26,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:25:26,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 18:25:26,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:26,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:35,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:44,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:44,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2018-12-03 18:25:44,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:44,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 18:25:44,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 18:25:44,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3328, Invalid=15032, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:25:44,571 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 91 states. [2018-12-03 18:25:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:50,222 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 18:25:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:25:50,223 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 46 [2018-12-03 18:25:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:50,223 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:25:50,224 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:25:50,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=3328, Invalid=15032, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:25:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:25:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 18:25:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:25:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 18:25:50,229 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 18:25:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:50,230 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 18:25:50,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 18:25:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 18:25:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:25:50,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:50,230 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-12-03 18:25:50,231 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:50,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-12-03 18:25:50,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:50,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:50,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:50,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:50,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:54,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:54,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:54,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:54,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:54,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:54,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:25:54,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:25:55,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:25:55,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:55,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:04,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:14,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:14,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2018-12-03 18:26:14,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:14,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 18:26:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 18:26:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3471, Invalid=15711, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 18:26:14,691 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 93 states. [2018-12-03 18:26:20,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:20,892 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 18:26:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:26:20,893 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 47 [2018-12-03 18:26:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:20,893 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:26:20,894 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:26:20,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5175 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=3471, Invalid=15711, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 18:26:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:26:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 18:26:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:26:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 18:26:20,899 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 18:26:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:20,899 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 18:26:20,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 18:26:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 18:26:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 18:26:20,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:20,900 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-12-03 18:26:20,900 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:20,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:20,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-12-03 18:26:20,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:20,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:20,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:26:20,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:20,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:25,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:25,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:25,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:25,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:25,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:25,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:26:25,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:26:25,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:26:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:25,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:36,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:46,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:46,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2018-12-03 18:26:46,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:46,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 18:26:46,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 18:26:46,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3617, Invalid=16405, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:26:46,802 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 95 states. [2018-12-03 18:26:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:53,504 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 18:26:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:26:53,505 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 48 [2018-12-03 18:26:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:53,506 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:26:53,506 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:26:53,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=3617, Invalid=16405, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:26:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:26:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:26:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:26:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 18:26:53,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 18:26:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:53,513 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 18:26:53,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 18:26:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 18:26:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:26:53,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:53,513 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-12-03 18:26:53,514 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:53,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-12-03 18:26:53,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:53,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:53,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:26:53,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:53,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:58,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:58,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:58,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:58,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:58,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:58,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:26:58,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:26:58,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:26:58,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 18:26:58,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:26:58,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:09,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:21,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:21,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2018-12-03 18:27:21,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:21,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 18:27:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 18:27:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3766, Invalid=17114, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 18:27:21,742 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 97 states. [2018-12-03 18:27:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:28,499 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 18:27:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:27:28,500 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 49 [2018-12-03 18:27:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:28,501 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:27:28,501 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:27:28,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=3766, Invalid=17114, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 18:27:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:27:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:27:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:27:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:27:28,508 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 18:27:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:28,508 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:27:28,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 18:27:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:27:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:27:28,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:28,509 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-12-03 18:27:28,509 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:28,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-12-03 18:27:28,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:28,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:28,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:33,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:33,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:33,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:33,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:33,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:33,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:33,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:27:33,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:27:33,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:27:33,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:33,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:45,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:57,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:57,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2018-12-03 18:27:57,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:57,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 18:27:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 18:27:57,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=17838, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:27:57,476 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 99 states. [2018-12-03 18:28:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:04,863 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 18:28:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:28:04,864 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 50 [2018-12-03 18:28:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:04,865 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:28:04,865 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:28:04,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=3918, Invalid=17838, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:28:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:28:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:28:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:28:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 18:28:04,872 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 18:28:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:04,873 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 18:28:04,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 18:28:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 18:28:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:28:04,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:04,873 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-12-03 18:28:04,874 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:04,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-12-03 18:28:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:04,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:28:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:04,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:10,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:10,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:10,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:10,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:10,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:10,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:28:10,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:10,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:28:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:10,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:22,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:35,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:35,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2018-12-03 18:28:35,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:35,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 18:28:35,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 18:28:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4073, Invalid=18577, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 18:28:35,788 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 101 states. [2018-12-03 18:28:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:42,525 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 18:28:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:28:42,525 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 51 [2018-12-03 18:28:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:42,526 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:28:42,526 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:28:42,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6125 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=4073, Invalid=18577, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 18:28:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:28:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:28:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:28:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:28:42,533 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 18:28:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:42,533 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:28:42,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 18:28:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:28:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:28:42,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:42,533 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-12-03 18:28:42,534 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:42,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-12-03 18:28:42,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:42,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:42,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:48,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:48,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:48,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:48,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:28:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:28:48,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:28:48,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:28:48,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:28:48,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:29:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:01,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:29:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:15,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:29:15,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2018-12-03 18:29:15,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:29:15,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 18:29:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 18:29:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4231, Invalid=19331, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:29:15,174 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 103 states. [2018-12-03 18:29:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:29:23,794 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 18:29:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:29:23,794 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 52 [2018-12-03 18:29:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:29:23,795 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:29:23,796 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:29:23,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6375 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=4231, Invalid=19331, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:29:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:29:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:29:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:29:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 18:29:23,802 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 18:29:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:29:23,802 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 18:29:23,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 18:29:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 18:29:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:29:23,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:29:23,802 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-12-03 18:29:23,803 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:29:23,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:29:23,803 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-12-03 18:29:23,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:29:23,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:23,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:29:23,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:23,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:29:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:29:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:30,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:30,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:29:30,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:29:30,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:29:30,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:30,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:29:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:29:30,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:29:30,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:29:30,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:29:30,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:29:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:44,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:29:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:58,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:29:58,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2018-12-03 18:29:58,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:29:58,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 18:29:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 18:29:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4392, Invalid=20100, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 18:29:58,848 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 105 states. [2018-12-03 18:30:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:30:06,868 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 18:30:06,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:30:06,868 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 53 [2018-12-03 18:30:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:30:06,869 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:30:06,869 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:30:06,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6630 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=4392, Invalid=20100, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 18:30:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:30:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 18:30:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 18:30:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 18:30:06,876 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 18:30:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:30:06,877 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 18:30:06,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 18:30:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 18:30:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:30:06,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:30:06,878 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-12-03 18:30:06,878 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:30:06,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:30:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-12-03 18:30:06,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:30:06,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:30:06,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:30:06,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:30:06,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:30:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:30:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:30:13,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:30:13,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:30:13,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:30:13,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:30:13,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:30:13,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:30:13,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:30:13,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:30:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:30:13,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:30:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:30:28,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:30:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:30:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:30:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2018-12-03 18:30:43,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:30:43,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 18:30:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 18:30:43,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4556, Invalid=20884, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:30:43,810 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 107 states. [2018-12-03 18:30:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:30:51,634 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 18:30:51,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:30:51,634 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 54 [2018-12-03 18:30:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:30:51,635 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:30:51,635 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 18:30:51,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6890 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=4556, Invalid=20884, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:30:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 18:30:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 18:30:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:30:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 18:30:51,641 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 18:30:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:30:51,641 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 18:30:51,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 18:30:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 18:30:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:30:51,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:30:51,642 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-12-03 18:30:51,642 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:30:51,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:30:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-12-03 18:30:51,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:30:51,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:30:51,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:30:51,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:30:51,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:30:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:30:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:30:58,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:30:58,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:30:58,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:30:58,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:30:58,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:30:58,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:30:58,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:30:58,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:30:58,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 18:30:58,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:30:58,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:31:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:31:14,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:31:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:31:30,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:31:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2018-12-03 18:31:30,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:31:30,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 18:31:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 18:31:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4723, Invalid=21683, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 18:31:30,844 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 109 states. [2018-12-03 18:31:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:31:41,191 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 18:31:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:31:41,192 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 55 [2018-12-03 18:31:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:31:41,192 INFO L225 Difference]: With dead ends: 58 [2018-12-03 18:31:41,193 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:31:41,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7155 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=4723, Invalid=21683, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 18:31:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:31:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 18:31:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:31:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 18:31:41,199 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 18:31:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:31:41,199 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 18:31:41,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 18:31:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 18:31:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:31:41,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:31:41,200 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-12-03 18:31:41,200 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:31:41,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:31:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-12-03 18:31:41,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:31:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:31:41,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:31:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:31:41,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:31:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:31:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:31:48,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:31:48,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:31:48,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:31:48,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:31:48,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:31:48,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:31:48,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:31:48,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:31:48,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:31:48,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:31:48,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:32:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:32:04,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:32:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:32:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:32:22,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2018-12-03 18:32:22,003 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:32:22,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 18:32:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 18:32:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4893, Invalid=22497, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:32:22,004 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 111 states. [2018-12-03 18:32:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:32:32,133 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 18:32:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:32:32,134 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 56 [2018-12-03 18:32:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:32:32,134 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:32:32,135 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:32:32,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7425 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=4893, Invalid=22497, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:32:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:32:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 18:32:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:32:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 18:32:32,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 18:32:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:32:32,141 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 18:32:32,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 18:32:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 18:32:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:32:32,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:32:32,141 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-12-03 18:32:32,141 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:32:32,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:32:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-12-03 18:32:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:32:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:32:32,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:32:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:32:32,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:32:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:32:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:32:40,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:32:40,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:32:40,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:32:40,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:32:40,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:32:40,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:32:40,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:32:40,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:32:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:32:40,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:32:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:32:57,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:33:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:15,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:33:15,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2018-12-03 18:33:15,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:33:15,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 18:33:15,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 18:33:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5066, Invalid=23326, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 18:33:15,269 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 113 states.