java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:26:36,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:26:36,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:26:36,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:26:36,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:26:36,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:26:36,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:26:36,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:26:36,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:26:36,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:26:36,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:26:36,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:26:36,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:26:36,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:26:36,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:26:36,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:26:36,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:26:36,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:26:36,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:26:36,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:26:36,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:26:36,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:26:36,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:26:36,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:26:36,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:26:36,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:26:36,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:26:36,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:26:36,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:26:36,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:26:36,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:26:36,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:26:36,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:26:36,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:26:36,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:26:36,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:26:36,056 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 17:26:36,074 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:26:36,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:26:36,075 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:26:36,075 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:26:36,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:26:36,076 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:26:36,076 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:26:36,076 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:26:36,076 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:26:36,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:26:36,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:26:36,079 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:26:36,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:26:36,080 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:26:36,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:26:36,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:26:36,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:26:36,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:26:36,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:26:36,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:26:36,083 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:26:36,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:26:36,083 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:26:36,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:26:36,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:26:36,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:26:36,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:36,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:26:36,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:26:36,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:26:36,085 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:26:36,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:26:36,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:26:36,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:26:36,086 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:26:36,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:26:36,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:26:36,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:26:36,164 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:26:36,165 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:26:36,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-01-18 17:26:36,166 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-01-18 17:26:36,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:26:36,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:26:36,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:26:36,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:26:36,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,242 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-18 17:26:36,242 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-18 17:26:36,242 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-18 17:26:36,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:26:36,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:26:36,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:26:36,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:26:36,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:26:36,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:36,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-18 17:26:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-18 17:26:36,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-18 17:26:36,498 INFO L278 CfgBuilder]: Using library mode [2019-01-18 17:26:36,499 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-18 17:26:36,500 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36 BoogieIcfgContainer [2019-01-18 17:26:36,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:26:36,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:26:36,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:26:36,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:26:36,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/2) ... [2019-01-18 17:26:36,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b067f36 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:26:36, skipping insertion in model container [2019-01-18 17:26:36,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36" (2/2) ... [2019-01-18 17:26:36,510 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-01-18 17:26:36,521 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:26:36,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:26:36,549 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:26:36,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:26:36,590 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:26:36,590 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:26:36,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:26:36,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:26:36,590 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:26:36,591 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:26:36,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:26:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 17:26:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:26:36,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:36,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:26:36,629 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:36,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:36,637 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-01-18 17:26:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:36,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:36,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,190 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-18 17:26:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:37,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:26:37,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:37,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:26:37,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:26:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:26:37,277 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-18 17:26:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:37,381 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:26:37,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:26:37,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:26:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:37,394 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:26:37,395 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:26:37,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:26:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:26:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-18 17:26:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 17:26:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 17:26:37,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-01-18 17:26:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:37,427 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 17:26:37,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:26:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 17:26:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:26:37,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:37,428 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 17:26:37,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-01-18 17:26:37,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,821 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-18 17:26:37,982 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-18 17:26:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:38,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:26:38,038 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-01-18 17:26:38,074 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:26:38,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:26:38,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:26:38,191 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 7 times. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 3. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:26:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:38,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:26:38,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:38,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:38,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:38,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:38,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:38,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:38,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:38,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:38,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:26:38,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:38,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:26:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:26:38,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:26:38,820 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-01-18 17:26:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,085 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-18 17:26:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:26:39,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 17:26:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,090 INFO L225 Difference]: With dead ends: 10 [2019-01-18 17:26:39,090 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:26:39,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:26:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:26:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-18 17:26:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:26:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 17:26:39,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-18 17:26:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,098 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 17:26:39,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:26:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 17:26:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:26:39,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,099 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-01-18 17:26:39,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-01-18 17:26:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:39,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:39,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:39,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:39,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:26:39,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:39,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:39,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:39,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:39,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:39,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:26:39,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:39,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:26:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:26:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:39,811 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-01-18 17:26:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,899 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 17:26:39,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:26:39,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:26:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,901 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:26:39,901 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:26:39,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:26:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-18 17:26:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 17:26:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-18 17:26:39,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-01-18 17:26:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,905 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-18 17:26:39,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:26:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-18 17:26:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:26:39,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,906 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-01-18 17:26:39,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-01-18 17:26:39,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:40,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:40,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:40,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:40,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:40,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:40,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:40,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:40,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:40,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:40,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:40,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:40,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:40,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:40,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:40,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:40,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:26:40,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:40,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:26:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:26:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:26:40,766 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-01-18 17:26:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:40,879 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:26:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:26:40,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 17:26:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:40,881 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:26:40,881 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:26:40,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:26:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:26:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-18 17:26:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:26:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 17:26:40,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-18 17:26:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:40,885 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 17:26:40,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:26:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 17:26:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:26:40,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:40,886 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-01-18 17:26:40,887 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-01-18 17:26:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:41,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:41,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:41,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:41,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:41,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:41,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:41,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:41,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-01-18 17:26:41,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:26:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:26:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,583 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-01-18 17:26:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:41,690 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-18 17:26:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:26:41,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-01-18 17:26:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:41,691 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:26:41,691 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:26:41,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:26:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-18 17:26:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:26:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-18 17:26:41,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-18 17:26:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:41,697 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-18 17:26:41,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:26:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-18 17:26:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-18 17:26:41,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:41,698 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-01-18 17:26:41,698 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-01-18 17:26:41,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:42,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:42,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:42,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:42,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:42,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:42,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-18 17:26:42,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:42,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:42,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:42,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:42,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:42,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:42,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-01-18 17:26:42,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:42,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:26:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:26:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:26:42,497 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-01-18 17:26:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:42,621 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-18 17:26:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:26:42,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-01-18 17:26:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:42,623 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:26:42,623 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:26:42,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:26:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:26:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-18 17:26:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:26:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-18 17:26:42,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-01-18 17:26:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:42,629 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-18 17:26:42,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:26:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-18 17:26:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:26:42,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:42,630 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-01-18 17:26:42,630 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-01-18 17:26:42,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:42,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:43,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:43,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:43,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:43,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:43,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:43,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:43,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:43,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:43,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:43,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:43,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:43,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:43,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:43,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:43,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:43,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:43,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:44,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-01-18 17:26:44,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:44,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:26:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:26:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:44,005 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-01-18 17:26:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:44,266 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-18 17:26:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:26:44,267 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-01-18 17:26:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:44,268 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:26:44,268 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:26:44,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:26:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-18 17:26:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:26:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-18 17:26:44,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-01-18 17:26:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:44,273 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-18 17:26:44,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:26:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-18 17:26:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-18 17:26:44,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:44,274 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-01-18 17:26:44,274 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-01-18 17:26:44,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:44,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:44,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:44,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:44,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:44,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:44,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:44,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:44,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:44,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:44,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:44,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:44,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:44,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:44,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:44,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:44,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:44,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:45,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-01-18 17:26:45,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:45,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:26:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:26:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:26:45,203 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-01-18 17:26:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:45,616 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-18 17:26:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:26:45,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-01-18 17:26:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:45,618 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:26:45,618 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:26:45,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:26:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:26:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-18 17:26:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:26:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-18 17:26:45,629 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-01-18 17:26:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:45,630 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-18 17:26:45,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:26:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-18 17:26:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-18 17:26:45,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:45,631 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-01-18 17:26:45,631 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-01-18 17:26:45,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:46,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:46,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:46,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:46,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:46,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:46,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:46,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:46,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-18 17:26:46,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:46,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:46,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:46,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:46,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:46,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:46,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:46,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:46,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-01-18 17:26:46,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:46,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:26:46,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:26:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:46,987 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-01-18 17:26:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:47,328 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-18 17:26:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:26:47,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-01-18 17:26:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:47,330 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:26:47,330 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:26:47,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:26:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-18 17:26:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:26:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-18 17:26:47,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-01-18 17:26:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:47,335 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-18 17:26:47,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:26:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-18 17:26:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-18 17:26:47,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:47,336 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-01-18 17:26:47,336 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-01-18 17:26:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:47,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:47,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:47,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:47,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:47,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:47,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:47,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:47,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:47,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:47,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:47,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:47,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:47,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:47,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:48,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:48,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:48,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:48,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:48,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:48,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:48,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-01-18 17:26:48,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:48,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:26:48,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:26:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-18 17:26:48,449 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-01-18 17:26:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:48,809 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-18 17:26:48,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:26:48,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-01-18 17:26:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:48,811 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:26:48,811 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:26:48,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-18 17:26:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:26:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-18 17:26:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:26:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-18 17:26:48,817 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-01-18 17:26:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:48,817 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-18 17:26:48,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:26:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-18 17:26:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:26:48,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:48,818 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-01-18 17:26:48,818 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-01-18 17:26:48,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:48,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:48,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:49,114 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:26:49,380 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:26:49,621 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:26:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:49,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:49,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:49,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:49,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:49,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:49,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:49,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:49,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:49,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:49,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:49,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:50,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:50,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:50,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:50,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:50,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:50,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-01-18 17:26:50,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:50,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:26:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:26:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:26:50,798 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-01-18 17:26:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:51,101 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-18 17:26:51,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:26:51,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-01-18 17:26:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:51,102 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:26:51,102 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:26:51,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:26:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:26:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-18 17:26:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:26:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-18 17:26:51,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-01-18 17:26:51,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:51,108 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-18 17:26:51,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:26:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-18 17:26:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-18 17:26:51,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:51,109 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-01-18 17:26:51,110 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:51,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:51,110 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-01-18 17:26:51,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:51,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:51,447 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:26:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:51,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:51,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:51,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:51,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:51,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:51,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:51,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:51,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:51,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-18 17:26:51,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:51,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:51,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:51,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:51,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:51,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:52,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:52,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:52,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:52,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:52,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:52,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:52,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-01-18 17:26:52,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:52,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:26:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:26:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-18 17:26:52,829 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-01-18 17:26:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:53,165 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-18 17:26:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:26:53,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-01-18 17:26:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:53,167 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:26:53,167 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:26:53,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-18 17:26:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:26:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-18 17:26:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:26:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-18 17:26:53,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-01-18 17:26:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:53,174 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-18 17:26:53,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:26:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-18 17:26:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:26:53,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:53,175 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-01-18 17:26:53,175 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-01-18 17:26:53,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:53,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:53,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:53,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:53,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:53,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:53,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:53,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:53,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:53,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:53,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:53,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:53,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:53,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:54,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:54,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:54,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:54,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:54,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:54,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:54,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-01-18 17:26:54,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:54,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:26:54,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:26:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:54,850 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-01-18 17:26:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:55,309 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-18 17:26:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:26:55,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-01-18 17:26:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:55,310 INFO L225 Difference]: With dead ends: 32 [2019-01-18 17:26:55,310 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:26:55,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:26:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-18 17:26:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:26:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-18 17:26:55,316 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-01-18 17:26:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:55,317 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-18 17:26:55,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:26:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-18 17:26:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-18 17:26:55,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:55,318 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-01-18 17:26:55,318 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:55,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-01-18 17:26:55,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:55,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:55,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:56,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:56,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:56,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:56,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:56,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:56,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:56,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:56,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:56,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:56,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:56,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:56,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:56,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:56,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:57,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:57,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-01-18 17:26:57,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:57,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:26:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:26:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-18 17:26:57,193 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-01-18 17:26:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:57,929 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-18 17:26:57,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:26:57,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-01-18 17:26:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:57,931 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:26:57,931 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:26:57,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-18 17:26:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:26:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-18 17:26:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:26:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-18 17:26:57,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-01-18 17:26:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:57,937 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-18 17:26:57,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:26:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-18 17:26:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:26:57,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:57,938 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-01-18 17:26:57,938 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-01-18 17:26:57,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:57,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:57,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:57,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:58,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:58,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:58,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:58,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:58,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:58,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:26:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:58,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:58,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-18 17:26:58,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:58,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:58,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:26:58,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:58,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:58,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:26:59,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:26:59,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:26:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:59,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:00,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:00,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-01-18 17:27:00,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:00,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:27:00,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:27:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:27:00,376 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-01-18 17:27:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:00,992 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-18 17:27:00,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:27:00,993 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-01-18 17:27:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:00,994 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:27:00,994 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:27:00,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:27:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:27:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-18 17:27:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:27:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-18 17:27:01,000 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-01-18 17:27:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:01,000 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-18 17:27:01,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:27:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-18 17:27:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-18 17:27:01,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:01,001 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-01-18 17:27:01,001 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-01-18 17:27:01,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:01,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:01,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:01,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:01,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:01,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:01,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:01,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:01,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:01,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:01,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:01,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:01,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:01,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:01,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:02,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:02,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:02,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:02,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:02,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:03,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:03,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-01-18 17:27:03,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:03,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:27:03,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:27:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-18 17:27:03,304 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-01-18 17:27:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:03,773 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-18 17:27:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:27:03,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-01-18 17:27:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:03,774 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:27:03,774 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:27:03,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-18 17:27:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:27:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-18 17:27:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:27:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-18 17:27:03,781 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-01-18 17:27:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:03,781 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-18 17:27:03,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:27:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-18 17:27:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:27:03,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:03,782 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-01-18 17:27:03,782 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-01-18 17:27:03,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:03,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:03,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:03,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:04,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:04,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:04,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:04,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:04,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:04,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:04,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:04,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:04,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:04,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:04,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:04,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:05,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:05,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:05,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:05,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:05,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:05,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:05,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-01-18 17:27:05,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:05,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:27:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:27:05,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:05,929 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-01-18 17:27:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:06,839 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-18 17:27:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:27:06,839 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-01-18 17:27:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:06,840 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:27:06,840 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:27:06,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:27:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-18 17:27:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:27:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-18 17:27:06,848 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-01-18 17:27:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:06,848 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-18 17:27:06,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:27:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-18 17:27:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-18 17:27:06,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:06,849 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-01-18 17:27:06,849 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-01-18 17:27:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:06,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:06,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:07,111 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:27:07,349 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:27:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:07,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:07,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:07,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:07,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:07,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:07,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:07,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:07,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:07,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-18 17:27:07,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:07,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:07,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:07,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:07,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:07,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:08,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:08,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:08,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:08,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:08,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-01-18 17:27:09,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:09,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:27:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:27:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-18 17:27:09,941 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-01-18 17:27:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:10,755 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-18 17:27:10,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:27:10,756 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-01-18 17:27:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:10,757 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:27:10,757 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:27:10,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-18 17:27:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:27:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-18 17:27:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:27:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-18 17:27:10,763 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-01-18 17:27:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:10,764 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-18 17:27:10,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:27:10,764 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-18 17:27:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-18 17:27:10,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:10,765 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-01-18 17:27:10,765 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-01-18 17:27:10,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:10,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:10,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:10,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:10,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:11,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:11,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:11,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:11,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:11,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:11,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:11,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:11,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:11,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:11,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:11,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:11,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:11,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:11,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:11,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:12,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:12,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:12,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:12,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:12,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:13,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:13,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-01-18 17:27:13,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:13,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:27:13,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:27:13,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:27:13,228 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-01-18 17:27:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:14,264 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-18 17:27:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:27:14,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-01-18 17:27:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:14,265 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:27:14,265 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:27:14,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:27:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:27:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-18 17:27:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:27:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-18 17:27:14,271 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-01-18 17:27:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:14,271 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-18 17:27:14,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:27:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-18 17:27:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-18 17:27:14,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:14,272 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-01-18 17:27:14,272 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-01-18 17:27:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:14,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:14,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:14,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:14,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:15,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:15,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:15,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:15,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:15,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:15,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:15,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:15,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:15,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:15,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:15,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:15,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:15,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:17,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:17,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-01-18 17:27:17,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:17,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:27:17,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:27:17,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-18 17:27:17,092 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-01-18 17:27:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:17,921 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-18 17:27:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:27:17,921 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-01-18 17:27:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:17,922 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:27:17,922 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:27:17,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-18 17:27:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:27:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-18 17:27:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-18 17:27:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-18 17:27:17,928 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-01-18 17:27:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:17,929 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-18 17:27:17,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:27:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-18 17:27:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-18 17:27:17,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:17,930 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-01-18 17:27:17,930 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-01-18 17:27:17,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:17,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:17,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:17,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:17,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:18,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:18,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:18,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:18,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:18,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:18,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:18,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-18 17:27:18,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:18,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:18,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:18,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:18,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:18,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:19,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:19,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:19,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:19,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:19,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:20,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:20,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-01-18 17:27:20,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:20,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:27:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:27:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:20,854 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-01-18 17:27:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:21,693 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-18 17:27:21,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:27:21,693 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-01-18 17:27:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:21,694 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:27:21,694 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:27:21,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:27:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-18 17:27:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:27:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-18 17:27:21,700 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-01-18 17:27:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:21,700 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-18 17:27:21,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:27:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-18 17:27:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-18 17:27:21,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:21,702 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-01-18 17:27:21,702 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-01-18 17:27:21,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:21,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:21,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:22,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:22,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:22,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:22,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:22,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:22,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:22,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:22,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:22,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:22,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:22,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:22,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:22,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:22,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:22,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:23,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:23,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:23,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:23,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:23,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:24,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:24,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-01-18 17:27:24,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:24,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:27:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:27:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-18 17:27:24,901 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-01-18 17:27:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:25,966 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-18 17:27:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:27:25,968 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-01-18 17:27:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:25,969 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:27:25,969 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:27:25,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-18 17:27:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:27:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-18 17:27:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:27:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-18 17:27:25,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-01-18 17:27:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:25,975 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-18 17:27:25,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:27:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-18 17:27:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-18 17:27:25,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:25,976 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-01-18 17:27:25,976 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-01-18 17:27:25,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:25,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:25,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:25,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:25,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:26,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:26,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:26,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:26,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:26,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:26,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:26,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:26,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:26,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:26,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:26,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:26,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:27,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:27,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:27,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:27,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:27,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:29,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-01-18 17:27:29,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:29,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:27:29,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:27:29,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:27:29,322 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-01-18 17:27:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:30,622 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-18 17:27:30,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:27:30,622 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-01-18 17:27:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:30,623 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:27:30,623 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:27:30,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:27:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:27:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-01-18 17:27:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 17:27:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-18 17:27:30,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-01-18 17:27:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:30,630 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-18 17:27:30,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:27:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-18 17:27:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-18 17:27:30,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:30,631 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-01-18 17:27:30,631 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-01-18 17:27:30,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:30,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:30,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,892 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:27:31,107 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-18 17:27:31,373 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:27:31,663 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:27:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:32,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:32,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:32,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:32,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:32,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:32,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:32,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:32,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-18 17:27:32,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:32,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:32,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:32,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:32,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:32,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:33,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:33,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:33,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:33,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:33,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:35,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:35,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-01-18 17:27:35,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:35,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:27:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:27:35,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-18 17:27:35,136 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-01-18 17:27:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:36,540 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-18 17:27:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:27:36,547 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-01-18 17:27:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:36,548 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:27:36,548 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:27:36,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-18 17:27:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:27:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-18 17:27:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:27:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-18 17:27:36,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-01-18 17:27:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:36,553 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-18 17:27:36,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:27:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-18 17:27:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:27:36,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:36,554 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-01-18 17:27:36,554 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-01-18 17:27:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:36,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:36,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:37,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:37,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:37,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:37,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:37,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:37,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:37,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:37,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:37,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:37,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:37,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:37,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:37,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:37,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:38,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:38,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:38,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:38,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:38,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:40,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:40,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-01-18 17:27:40,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:40,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:27:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:27:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:27:40,298 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-01-18 17:27:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:41,459 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-18 17:27:41,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:27:41,459 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-01-18 17:27:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:41,460 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:27:41,460 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:27:41,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:27:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:27:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-01-18 17:27:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:27:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-18 17:27:41,466 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-01-18 17:27:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:41,466 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-18 17:27:41,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:27:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-18 17:27:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-18 17:27:41,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:41,467 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-01-18 17:27:41,467 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-01-18 17:27:41,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:41,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:41,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:41,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:41,669 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:27:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:42,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:42,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:42,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:42,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:42,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:42,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:42,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:42,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:42,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:42,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:42,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:42,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:42,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:43,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:43,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:43,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:43,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:43,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:46,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:46,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-01-18 17:27:46,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:46,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:27:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:27:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-18 17:27:46,964 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-01-18 17:27:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:48,177 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-18 17:27:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:27:48,177 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-01-18 17:27:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:48,178 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:27:48,178 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:27:48,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-18 17:27:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:27:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-18 17:27:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:27:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-18 17:27:48,188 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-01-18 17:27:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:48,188 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-18 17:27:48,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:27:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-18 17:27:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:27:48,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:48,189 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-01-18 17:27:48,189 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:48,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-01-18 17:27:48,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:48,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:48,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:48,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:48,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:48,464 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:27:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:49,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:49,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:49,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:49,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:49,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:49,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-18 17:27:49,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:49,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:49,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:49,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:49,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:49,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:50,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:50,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:50,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:50,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:50,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:52,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:52,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-01-18 17:27:52,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:52,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:27:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:27:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:27:52,804 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-01-18 17:27:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:54,545 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-18 17:27:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:27:54,545 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-01-18 17:27:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:54,546 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:27:54,546 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:27:54,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:27:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:27:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-18 17:27:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:27:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-18 17:27:54,550 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-01-18 17:27:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:54,550 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-18 17:27:54,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:27:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-18 17:27:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-18 17:27:54,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:54,551 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-01-18 17:27:54,551 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-01-18 17:27:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:54,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:54,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:54,805 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:27:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:56,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:56,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:56,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:56,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:56,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:56,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:27:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:56,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:56,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:56,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:56,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:56,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:27:56,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:56,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:56,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:27:57,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:27:57,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:57,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:57,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:27:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:57,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:59,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-01-18 17:27:59,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:59,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:27:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:27:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-18 17:27:59,339 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-01-18 17:28:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:00,958 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-18 17:28:00,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:28:00,959 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-01-18 17:28:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:00,959 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:28:00,960 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:28:00,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-18 17:28:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:28:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-01-18 17:28:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:28:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-18 17:28:00,964 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-01-18 17:28:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:00,964 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-18 17:28:00,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:28:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-18 17:28:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-18 17:28:00,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:00,965 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-01-18 17:28:00,965 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-01-18 17:28:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:00,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:00,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:01,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:01,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:01,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:01,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:01,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:01,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:02,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:02,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:02,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:02,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:02,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:02,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:02,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:03,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:03,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:03,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:03,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:03,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:05,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:05,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-01-18 17:28:05,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:05,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:28:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:28:05,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:28:05,748 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-01-18 17:28:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:07,202 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-18 17:28:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:28:07,203 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-01-18 17:28:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:07,203 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:28:07,204 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:28:07,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:28:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:28:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-18 17:28:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 17:28:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-18 17:28:07,208 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-01-18 17:28:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:07,209 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-18 17:28:07,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:28:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-18 17:28:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-18 17:28:07,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:07,210 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-01-18 17:28:07,210 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:07,210 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-01-18 17:28:07,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:07,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:07,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:08,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:08,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:08,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:08,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:08,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:08,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:08,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:08,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:08,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-18 17:28:08,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:08,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:08,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:08,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:08,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:08,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:09,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:09,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:09,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:09,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:09,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:12,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:12,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-01-18 17:28:12,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:12,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:28:12,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:28:12,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-18 17:28:12,394 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-01-18 17:28:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:14,233 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-18 17:28:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:28:14,234 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-01-18 17:28:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:14,235 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:28:14,235 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:28:14,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-18 17:28:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:28:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-18 17:28:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:28:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-18 17:28:14,240 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-01-18 17:28:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:14,240 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-18 17:28:14,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:28:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-18 17:28:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-18 17:28:14,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:14,241 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-01-18 17:28:14,241 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-01-18 17:28:14,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:14,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:14,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:14,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:14,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:14,460 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:28:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:15,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:15,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:15,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:15,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:15,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:15,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:15,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:15,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:15,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:15,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:15,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:15,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:15,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:15,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:15,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:17,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:17,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:17,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:17,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:17,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:19,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:19,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-01-18 17:28:19,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:19,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:28:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:28:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:28:19,725 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-01-18 17:28:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:21,501 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-18 17:28:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:28:21,502 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-01-18 17:28:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:21,503 INFO L225 Difference]: With dead ends: 68 [2019-01-18 17:28:21,503 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:28:21,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:28:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:28:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-18 17:28:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:28:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-18 17:28:21,508 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-01-18 17:28:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:21,509 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-18 17:28:21,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:28:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-18 17:28:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:28:21,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:21,509 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-01-18 17:28:21,510 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-01-18 17:28:21,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:21,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:21,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:22,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:22,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:22,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:22,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:22,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:22,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:22,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:22,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:22,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:22,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:22,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:22,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:24,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:24,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:24,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:24,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:24,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:27,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:27,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-01-18 17:28:27,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:27,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:28:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:28:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-18 17:28:27,193 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-01-18 17:28:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:29,096 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-18 17:28:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:28:29,096 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-01-18 17:28:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:29,097 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:28:29,097 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:28:29,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-18 17:28:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:28:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-18 17:28:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:28:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-18 17:28:29,101 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-01-18 17:28:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:29,102 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-18 17:28:29,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:28:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-18 17:28:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-18 17:28:29,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:29,102 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-01-18 17:28:29,103 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:29,103 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-01-18 17:28:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:29,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:29,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:29,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:29,270 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:28:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:30,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:30,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:30,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:30,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:30,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:30,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:30,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:30,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:30,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-18 17:28:30,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:30,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:30,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:30,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:30,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:30,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:32,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:32,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:32,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:32,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:32,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-01-18 17:28:35,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:35,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:28:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:28:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:28:35,078 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-01-18 17:28:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:37,821 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-18 17:28:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:28:37,822 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-01-18 17:28:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:37,823 INFO L225 Difference]: With dead ends: 72 [2019-01-18 17:28:37,823 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:28:37,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:28:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:28:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-01-18 17:28:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-18 17:28:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-18 17:28:37,826 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-01-18 17:28:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:37,827 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-18 17:28:37,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:28:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-18 17:28:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-18 17:28:37,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:37,828 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-01-18 17:28:37,828 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-01-18 17:28:37,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:37,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:37,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:38,071 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:28:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:39,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:39,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:39,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:39,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:39,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:39,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:39,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:39,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:39,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:39,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:39,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:39,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:39,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:39,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:39,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:41,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:41,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:41,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:41,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:41,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:44,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-01-18 17:28:44,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:44,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:28:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:28:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-18 17:28:44,292 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-01-18 17:28:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:46,596 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-18 17:28:46,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:28:46,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-01-18 17:28:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:46,597 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:28:46,598 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:28:46,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-18 17:28:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:28:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-18 17:28:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:28:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-18 17:28:46,602 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-01-18 17:28:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:46,603 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-18 17:28:46,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:28:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-18 17:28:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:28:46,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:46,604 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-01-18 17:28:46,604 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-01-18 17:28:46,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:46,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:46,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:46,792 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:28:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:48,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:48,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:48,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:48,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:48,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:48,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:48,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:48,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:48,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:48,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:48,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:48,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:48,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:49,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:49,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:49,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:49,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:49,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:53,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-01-18 17:28:53,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:28:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:28:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:28:53,184 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-01-18 17:28:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:55,538 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-18 17:28:55,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:28:55,539 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-01-18 17:28:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:55,540 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:28:55,540 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:28:55,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:28:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:28:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-01-18 17:28:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:28:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-18 17:28:55,546 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-01-18 17:28:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:55,546 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-18 17:28:55,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:28:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-18 17:28:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-18 17:28:55,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:55,547 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-01-18 17:28:55,547 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-01-18 17:28:55,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:55,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:55,762 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:28:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:57,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:57,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:57,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:57,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:57,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:57,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:28:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:57,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:57,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-18 17:28:57,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:57,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:57,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:28:57,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:57,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:57,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:28:59,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:28:59,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:59,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:59,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:28:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:59,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:02,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:02,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-01-18 17:29:02,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:02,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:29:02,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:29:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-18 17:29:02,967 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-01-18 17:29:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:05,847 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-18 17:29:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:29:05,848 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-01-18 17:29:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:05,849 INFO L225 Difference]: With dead ends: 78 [2019-01-18 17:29:05,849 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:29:05,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-18 17:29:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:29:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-18 17:29:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:29:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-18 17:29:05,854 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-01-18 17:29:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:05,854 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-18 17:29:05,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:29:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-18 17:29:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:29:05,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:05,855 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-01-18 17:29:05,855 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-01-18 17:29:05,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:05,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:05,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:05,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:05,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:07,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:07,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:07,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:07,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:07,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:07,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:29:07,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:07,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:07,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:07,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:07,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:07,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:29:07,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:07,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:07,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:29:09,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:29:09,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:09,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:09,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:29:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:09,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-01-18 17:29:13,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:13,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:29:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:29:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:29:13,280 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-01-18 17:29:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:16,083 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-18 17:29:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:29:16,083 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-01-18 17:29:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:16,084 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:29:16,084 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:29:16,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:29:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:29:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-18 17:29:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:29:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-18 17:29:16,089 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-01-18 17:29:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:16,090 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-18 17:29:16,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:29:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-18 17:29:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-18 17:29:16,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:16,090 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-01-18 17:29:16,091 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-01-18 17:29:16,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:16,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:16,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:16,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:16,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:17,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:17,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:17,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:17,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:17,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:17,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:29:17,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:17,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:17,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:17,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:29:17,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:17,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:17,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:29:20,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:29:20,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:20,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:20,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:29:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:20,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:23,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-01-18 17:29:23,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:23,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:29:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:29:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-18 17:29:23,976 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-01-18 17:29:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:26,629 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-18 17:29:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:29:26,631 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-01-18 17:29:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:26,632 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:29:26,632 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:29:26,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-18 17:29:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:29:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-18 17:29:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:29:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-18 17:29:26,637 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-01-18 17:29:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:26,637 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-18 17:29:26,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:29:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-18 17:29:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:29:26,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:26,638 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-01-18 17:29:26,638 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-01-18 17:29:26,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:26,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:26,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:26,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:26,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:28,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:28,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:28,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:28,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:28,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:28,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:29:28,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:28,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:28,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-18 17:29:28,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:28,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:28,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:29:28,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:28,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:28,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:29:30,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:29:30,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:30,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:30,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:29:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:30,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:34,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-01-18 17:29:34,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:34,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:29:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:29:34,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:29:34,839 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-01-18 17:29:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:38,410 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-18 17:29:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:29:38,410 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-01-18 17:29:38,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:38,411 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:29:38,411 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:29:38,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:29:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:29:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-01-18 17:29:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:29:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-18 17:29:38,416 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-01-18 17:29:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:38,417 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-18 17:29:38,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:29:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-18 17:29:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-18 17:29:38,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:38,417 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-01-18 17:29:38,417 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-01-18 17:29:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:38,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:38,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:38,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:38,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:38,639 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:29:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:40,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:40,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:40,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:40,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:40,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:40,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:29:40,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:40,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:40,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:40,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:40,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:40,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:29:40,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:40,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:40,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:29:42,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:29:42,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:42,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:42,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:29:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:42,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:46,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:46,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-01-18 17:29:46,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:46,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:29:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:29:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-18 17:29:46,777 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-01-18 17:29:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:49,624 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-18 17:29:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:29:49,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-01-18 17:29:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:49,626 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:29:49,626 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:29:49,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-18 17:29:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:29:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-01-18 17:29:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:29:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-18 17:29:49,632 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-01-18 17:29:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:49,632 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-18 17:29:49,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:29:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-18 17:29:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:29:49,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:49,633 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-01-18 17:29:49,633 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:49,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-01-18 17:29:49,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:49,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:49,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:49,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:49,919 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:29:50,087 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:29:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:51,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:51,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:51,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:51,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:51,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:51,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:29:51,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:51,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:51,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:51,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:29:51,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:51,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:51,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:29:54,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:29:54,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:54,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:54,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:29:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:54,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:58,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-01-18 17:29:58,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:58,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:29:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:29:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:29:58,826 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-01-18 17:30:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:02,640 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-18 17:30:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:30:02,640 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-01-18 17:30:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:02,649 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:30:02,649 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:30:02,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:30:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:30:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-01-18 17:30:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-18 17:30:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-18 17:30:02,654 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-01-18 17:30:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:02,654 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-18 17:30:02,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:30:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-18 17:30:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-18 17:30:02,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:02,655 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-01-18 17:30:02,655 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-01-18 17:30:02,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:02,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:04,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:04,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:04,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:04,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:04,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:04,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:04,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:04,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:04,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-18 17:30:04,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:04,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:04,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:30:04,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:04,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:04,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:30:07,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:30:07,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:07,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:07,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:30:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:07,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:11,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:11,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-01-18 17:30:11,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:11,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:30:11,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:30:11,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-18 17:30:11,938 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-01-18 17:30:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:16,527 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-18 17:30:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:30:16,528 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-01-18 17:30:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:16,529 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:30:16,529 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:30:16,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-18 17:30:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:30:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-18 17:30:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-18 17:30:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-18 17:30:16,534 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-01-18 17:30:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:16,534 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-18 17:30:16,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:30:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-18 17:30:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-18 17:30:16,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:16,535 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-01-18 17:30:16,535 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-01-18 17:30:16,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:16,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:16,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:18,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:18,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:18,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:18,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:18,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:18,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:18,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:18,425 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:18,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:18,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:18,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:30:18,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:18,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:18,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:30:21,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:30:21,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:21,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:21,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:30:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:21,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:25,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:25,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-01-18 17:30:25,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:25,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:30:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:30:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:30:25,951 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-01-18 17:30:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:30,525 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-18 17:30:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:30:30,525 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-01-18 17:30:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:30,526 INFO L225 Difference]: With dead ends: 92 [2019-01-18 17:30:30,526 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:30:30,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:30:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:30:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-18 17:30:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-18 17:30:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-18 17:30:30,532 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-01-18 17:30:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:30,532 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-18 17:30:30,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:30:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-18 17:30:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-18 17:30:30,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:30,533 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-01-18 17:30:30,533 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-01-18 17:30:30,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:30,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:30,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:30,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:30,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:30,714 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:30:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:32,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:32,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:32,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:32,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:32,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:32,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:32,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:32,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:32,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:32,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:30:32,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:32,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:32,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:30:35,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:30:35,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:35,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:35,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:30:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:35,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:40,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:40,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-01-18 17:30:40,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:40,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 17:30:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 17:30:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-18 17:30:40,607 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-01-18 17:30:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:44,367 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-18 17:30:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:30:44,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-01-18 17:30:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:44,368 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:30:44,368 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:30:44,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-18 17:30:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:30:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-01-18 17:30:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:30:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-18 17:30:44,371 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-01-18 17:30:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:44,372 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-18 17:30:44,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 17:30:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-18 17:30:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:30:44,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:44,372 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-01-18 17:30:44,372 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-01-18 17:30:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:44,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:44,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:44,567 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:30:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:46,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:46,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:46,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:46,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:46,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:46,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:46,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-18 17:30:46,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:46,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:46,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:30:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:46,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:46,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:30:50,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:30:50,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:30:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:50,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-01-18 17:30:55,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:55,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 17:30:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 17:30:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:55,456 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-01-18 17:30:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:59,500 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-18 17:30:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:30:59,500 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-01-18 17:30:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:59,501 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:30:59,501 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:30:59,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:30:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-01-18 17:30:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-18 17:30:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-18 17:30:59,506 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-01-18 17:30:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:59,506 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-18 17:30:59,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 17:30:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-18 17:30:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-18 17:30:59,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:59,507 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-01-18 17:30:59,507 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-01-18 17:30:59,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:59,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:59,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:59,785 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:31:00,057 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:31:00,338 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:31:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:02,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:02,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:02,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:02,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:02,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:02,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:31:02,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:02,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:02,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:02,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:02,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:02,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:31:02,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:02,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:02,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:31:05,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:31:05,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:05,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:05,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:31:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:05,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-01-18 17:31:11,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:11,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 17:31:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 17:31:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-18 17:31:11,079 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-01-18 17:31:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:15,514 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-18 17:31:15,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:31:15,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-01-18 17:31:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:15,516 INFO L225 Difference]: With dead ends: 98 [2019-01-18 17:31:15,516 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:31:15,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-18 17:31:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:31:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-01-18 17:31:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 17:31:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-18 17:31:15,521 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-01-18 17:31:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:15,521 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-18 17:31:15,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 17:31:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-18 17:31:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 17:31:15,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:15,522 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-01-18 17:31:15,522 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-01-18 17:31:15,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:15,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:15,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:15,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:15,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:15,759 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:31:15,941 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:31:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:17,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:17,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:17,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:17,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:17,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:17,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:31:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:17,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:17,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:17,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:31:17,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:17,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:17,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:31:21,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:31:21,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:31:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:21,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:26,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-01-18 17:31:26,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:26,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 17:31:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 17:31:26,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:31:26,998 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-01-18 17:31:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:31,218 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-18 17:31:31,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:31:31,218 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-01-18 17:31:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:31,219 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:31:31,219 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:31:31,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:31:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:31:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-18 17:31:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 17:31:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-18 17:31:31,224 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-01-18 17:31:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:31,224 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-18 17:31:31,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 17:31:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-18 17:31:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-18 17:31:31,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:31,225 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-01-18 17:31:31,225 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:31,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-01-18 17:31:31,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:31,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:31,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:31,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:31,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:31,445 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:31:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:33,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:33,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:33,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:33,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:33,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:33,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:31:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:33,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:33,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-18 17:31:33,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:33,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:33,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:31:33,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:31:38,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:31:38,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:31:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:38,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:44,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:44,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-01-18 17:31:44,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:44,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 17:31:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 17:31:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-18 17:31:44,009 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-01-18 17:31:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:48,236 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-18 17:31:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:31:48,236 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-01-18 17:31:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:48,237 INFO L225 Difference]: With dead ends: 102 [2019-01-18 17:31:48,237 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:31:48,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-18 17:31:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:31:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-18 17:31:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 17:31:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-18 17:31:48,244 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-01-18 17:31:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:48,244 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-18 17:31:48,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 17:31:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-18 17:31:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-18 17:31:48,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:48,245 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-01-18 17:31:48,245 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-01-18 17:31:48,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:48,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:48,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:48,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:48,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:50,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:50,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:50,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:50,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:50,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:50,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:31:50,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:50,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:50,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:50,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:50,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:50,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:31:50,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:31:53,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:31:53,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:31:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:54,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:00,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:00,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-01-18 17:32:00,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:00,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 17:32:00,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 17:32:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:32:00,109 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-01-18 17:32:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:04,480 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-18 17:32:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:32:04,481 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-01-18 17:32:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:04,482 INFO L225 Difference]: With dead ends: 104 [2019-01-18 17:32:04,482 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:32:04,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:32:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:32:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-18 17:32:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 17:32:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-18 17:32:04,489 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-01-18 17:32:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:04,489 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-18 17:32:04,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 17:32:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-18 17:32:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-18 17:32:04,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:04,490 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-01-18 17:32:04,490 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-01-18 17:32:04,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:04,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:04,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:04,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:04,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:07,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:07,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:07,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:07,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:32:07,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:07,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:07,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:32:07,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:32:10,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:32:10,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:32:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:10,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:17,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:17,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-01-18 17:32:17,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:17,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 17:32:17,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 17:32:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 17:32:17,339 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-01-18 17:32:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:22,057 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-18 17:32:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:32:22,058 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-01-18 17:32:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:22,059 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:32:22,060 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:32:22,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 17:32:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:32:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-18 17:32:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-18 17:32:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-18 17:32:22,066 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-01-18 17:32:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:22,066 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-18 17:32:22,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 17:32:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-18 17:32:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-18 17:32:22,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:22,067 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-01-18 17:32:22,068 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-01-18 17:32:22,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:22,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:22,347 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:32:22,615 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:32:22,886 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:32:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:25,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:25,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:25,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:25,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:25,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:25,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:32:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:25,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:25,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-18 17:32:25,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:25,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:25,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:32:25,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:25,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:25,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:32:29,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:32:29,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:29,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:29,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:32:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:29,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:36,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:36,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-01-18 17:32:36,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:36,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 17:32:36,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 17:32:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:32:36,149 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-01-18 17:32:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:41,649 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-18 17:32:41,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:32:41,650 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-01-18 17:32:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:41,651 INFO L225 Difference]: With dead ends: 108 [2019-01-18 17:32:41,652 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:32:41,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:32:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:32:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-18 17:32:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-18 17:32:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-18 17:32:41,659 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-01-18 17:32:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:41,659 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-18 17:32:41,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 17:32:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-18 17:32:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-18 17:32:41,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:41,660 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-01-18 17:32:41,661 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-01-18 17:32:41,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:41,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:41,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:44,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:44,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:44,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:44,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:44,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:44,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:32:44,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:32:44,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:32:44,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:32:44,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:44,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:44,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:32:44,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:44,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:44,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:32:48,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:32:48,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:48,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:48,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:32:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:48,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:55,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:55,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-01-18 17:32:55,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:55,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-18 17:32:55,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-18 17:32:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-18 17:32:55,389 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-01-18 17:33:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:02,308 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-18 17:33:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:33:02,308 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-01-18 17:33:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:02,309 INFO L225 Difference]: With dead ends: 110 [2019-01-18 17:33:02,309 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:33:02,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-18 17:33:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:33:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-18 17:33:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 17:33:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-18 17:33:02,315 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-01-18 17:33:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:02,315 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-18 17:33:02,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-18 17:33:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-18 17:33:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 17:33:02,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:02,316 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-01-18 17:33:02,316 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:02,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-01-18 17:33:02,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:02,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:02,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:02,602 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:33:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:05,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:05,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:05,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:05,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:05,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:05,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:33:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:05,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:33:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:05,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:05,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:33:05,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:05,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:05,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:33:09,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:33:09,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:09,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:09,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:33:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:09,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:16,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:16,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-01-18 17:33:16,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:16,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-18 17:33:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-18 17:33:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:33:16,695 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-01-18 17:33:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:21,448 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-18 17:33:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:33:21,448 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-01-18 17:33:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:21,449 INFO L225 Difference]: With dead ends: 112 [2019-01-18 17:33:21,449 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:33:21,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:33:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:33:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-01-18 17:33:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-18 17:33:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-18 17:33:21,454 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-01-18 17:33:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:21,455 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-18 17:33:21,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-18 17:33:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-18 17:33:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-18 17:33:21,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:21,455 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-01-18 17:33:21,455 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-01-18 17:33:21,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:21,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:21,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:21,684 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:33:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:24,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:24,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:24,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:24,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:24,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:24,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:33:24,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:33:24,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:24,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-18 17:33:24,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:24,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:24,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:33:24,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:24,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:24,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:33:28,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:33:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:28,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:28,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:33:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:28,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:36,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:36,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-01-18 17:33:36,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:36,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 17:33:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 17:33:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 17:33:36,109 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-01-18 17:33:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:42,545 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-18 17:33:42,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:33:42,545 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-01-18 17:33:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:42,546 INFO L225 Difference]: With dead ends: 114 [2019-01-18 17:33:42,546 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:33:42,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 17:33:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:33:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-01-18 17:33:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 17:33:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-18 17:33:42,552 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-01-18 17:33:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:42,553 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-18 17:33:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 17:33:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-18 17:33:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 17:33:42,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:42,554 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-01-18 17:33:42,554 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-01-18 17:33:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:42,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:42,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:42,816 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:33:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:45,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:45,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:45,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:45,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:45,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:45,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-18 17:33:45,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:33:45,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:33:45,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:33:45,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:45,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:45,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:33:45,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:45,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:45,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:33:50,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:33:50,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:50,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:50,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:33:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:50,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:57,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:57,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-01-18 17:33:57,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:57,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-01-18 17:33:57,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-01-18 17:33:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:33:57,878 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-01-18 17:34:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:03,146 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-18 17:34:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:34:03,147 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-01-18 17:34:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:03,148 INFO L225 Difference]: With dead ends: 116 [2019-01-18 17:34:03,148 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:34:03,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:34:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:34:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-01-18 17:34:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-18 17:34:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-18 17:34:03,154 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-01-18 17:34:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:03,155 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-18 17:34:03,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-01-18 17:34:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-18 17:34:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-18 17:34:03,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:03,156 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-01-18 17:34:03,156 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-01-18 17:34:03,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:03,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:03,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:06,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:06,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:06,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:06,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:06,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:06,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-18 17:34:06,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:06,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:06,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:06,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:34:06,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:06,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:06,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:34:10,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:34:10,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:10,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:10,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:34:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:10,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:18,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:18,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-01-18 17:34:18,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-01-18 17:34:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-01-18 17:34:18,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 17:34:18,415 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-01-18 17:34:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:25,805 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-18 17:34:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:34:25,806 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-01-18 17:34:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:25,807 INFO L225 Difference]: With dead ends: 118 [2019-01-18 17:34:25,807 INFO L226 Difference]: Without dead ends: 117 [2019-01-18 17:34:25,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 17:34:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-18 17:34:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-01-18 17:34:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-18 17:34:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-18 17:34:25,812 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-01-18 17:34:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:25,813 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-18 17:34:25,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-01-18 17:34:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-18 17:34:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-18 17:34:25,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:25,813 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-01-18 17:34:25,814 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-01-18 17:34:25,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:25,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:25,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:25,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:25,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:28,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:28,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:28,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:28,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:28,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:28,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:34:28,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:28,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:28,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-18 17:34:28,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:28,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:28,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:34:28,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:34:33,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:34:33,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:34:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:33,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:41,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:41,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-01-18 17:34:41,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:41,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-18 17:34:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-18 17:34:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:34:41,942 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-01-18 17:34:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:47,908 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-18 17:34:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:34:47,909 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-01-18 17:34:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:47,910 INFO L225 Difference]: With dead ends: 120 [2019-01-18 17:34:47,910 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 17:34:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:34:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 17:34:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-18 17:34:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-18 17:34:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-01-18 17:34:47,915 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-01-18 17:34:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:47,916 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-01-18 17:34:47,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-18 17:34:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-01-18 17:34:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-18 17:34:47,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:47,916 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-01-18 17:34:47,916 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:47,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-01-18 17:34:47,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:47,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:47,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:48,199 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:34:48,431 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:34:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:51,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:51,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:51,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:51,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:51,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:51,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:34:51,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:51,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:51,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:51,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:51,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:51,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:34:51,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:51,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:51,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:34:56,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:34:56,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:56,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:56,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:34:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:56,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:05,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-01-18 17:35:05,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:05,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-01-18 17:35:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-01-18 17:35:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 17:35:05,058 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-01-18 17:35:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:10,651 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-01-18 17:35:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:35:10,652 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-01-18 17:35:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:10,653 INFO L225 Difference]: With dead ends: 122 [2019-01-18 17:35:10,653 INFO L226 Difference]: Without dead ends: 121 [2019-01-18 17:35:10,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 17:35:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-18 17:35:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-01-18 17:35:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-18 17:35:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-01-18 17:35:10,659 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-01-18 17:35:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:10,659 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-01-18 17:35:10,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-01-18 17:35:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-01-18 17:35:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-18 17:35:10,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:10,660 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-01-18 17:35:10,660 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-01-18 17:35:10,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:10,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:10,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:13,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:13,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:13,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:13,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:13,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:13,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:35:13,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:13,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:13,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:13,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:35:13,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:35:18,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:35:18,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:35:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:18,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-01-18 17:35:27,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:27,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-01-18 17:35:27,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-01-18 17:35:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:35:27,458 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-01-18 17:35:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:34,678 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-01-18 17:35:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:35:34,683 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-01-18 17:35:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:34,684 INFO L225 Difference]: With dead ends: 124 [2019-01-18 17:35:34,684 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 17:35:34,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 17:35:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 17:35:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-01-18 17:35:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-18 17:35:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-18 17:35:34,690 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-01-18 17:35:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:34,690 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-18 17:35:34,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-01-18 17:35:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-18 17:35:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-18 17:35:34,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:34,691 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-01-18 17:35:34,691 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-01-18 17:35:34,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:34,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:34,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:37,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:37,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:37,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:37,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:37,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:35:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:37,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:38,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-18 17:35:38,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:38,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:38,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:35:38,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:38,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:38,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:35:43,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:35:43,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:35:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:43,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:52,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:52,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-01-18 17:35:52,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:52,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-18 17:35:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-18 17:35:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-18 17:35:52,262 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-01-18 17:36:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:01,013 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-18 17:36:01,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:36:01,014 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-01-18 17:36:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:01,015 INFO L225 Difference]: With dead ends: 126 [2019-01-18 17:36:01,015 INFO L226 Difference]: Without dead ends: 125 [2019-01-18 17:36:01,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-18 17:36:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-18 17:36:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-01-18 17:36:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-18 17:36:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-01-18 17:36:01,021 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-01-18 17:36:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:01,022 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-01-18 17:36:01,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-18 17:36:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-01-18 17:36:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-18 17:36:01,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:01,023 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-01-18 17:36:01,023 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-01-18 17:36:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:01,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:01,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:04,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:04,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:04,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:04,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:04,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:04,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:36:04,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:04,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:04,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:04,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:04,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:04,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:36:04,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:36:09,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:36:09,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:36:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:09,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:19,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:19,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-01-18 17:36:19,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:19,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-01-18 17:36:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-01-18 17:36:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:36:19,328 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-01-18 17:36:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:28,514 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-01-18 17:36:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:36:28,514 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-01-18 17:36:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:28,515 INFO L225 Difference]: With dead ends: 128 [2019-01-18 17:36:28,515 INFO L226 Difference]: Without dead ends: 127 [2019-01-18 17:36:28,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:36:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-18 17:36:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-18 17:36:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-18 17:36:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-18 17:36:28,521 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-01-18 17:36:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:28,522 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-18 17:36:28,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-01-18 17:36:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-18 17:36:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-18 17:36:28,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:28,523 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-01-18 17:36:28,523 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-01-18 17:36:28,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:28,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:28,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:28,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:28,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:31,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:31,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:31,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:31,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:31,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:31,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:36:31,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:31,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:31,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:31,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:36:31,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:36:37,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:36:37,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:37,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:37,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:36:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:37,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:46,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:46,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-01-18 17:36:46,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:46,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-01-18 17:36:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-01-18 17:36:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-18 17:36:46,944 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-01-18 17:36:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:54,903 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-18 17:36:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:36:54,903 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-01-18 17:36:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:54,904 INFO L225 Difference]: With dead ends: 130 [2019-01-18 17:36:54,904 INFO L226 Difference]: Without dead ends: 129 [2019-01-18 17:36:54,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-18 17:36:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-18 17:36:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-01-18 17:36:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-18 17:36:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-01-18 17:36:54,910 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-01-18 17:36:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:54,910 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-01-18 17:36:54,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-01-18 17:36:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-01-18 17:36:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-18 17:36:54,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:54,911 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-01-18 17:36:54,911 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-01-18 17:36:54,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:54,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:58,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:58,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:58,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:58,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:58,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:58,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:36:58,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:58,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:58,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-18 17:36:58,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:58,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:58,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:36:58,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:58,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:58,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:37:03,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:37:03,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:37:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:04,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:13,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-01-18 17:37:13,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:13,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-18 17:37:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-18 17:37:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 17:37:13,878 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-01-18 17:37:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:20,181 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-01-18 17:37:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:37:20,182 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-01-18 17:37:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:20,183 INFO L225 Difference]: With dead ends: 132 [2019-01-18 17:37:20,183 INFO L226 Difference]: Without dead ends: 131 [2019-01-18 17:37:20,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 17:37:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-18 17:37:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-01-18 17:37:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-18 17:37:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-01-18 17:37:20,189 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-01-18 17:37:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:20,189 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-01-18 17:37:20,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-18 17:37:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-01-18 17:37:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-18 17:37:20,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:20,190 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-01-18 17:37:20,190 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-01-18 17:37:20,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:20,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:20,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:23,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:23,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:23,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:23,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:23,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:23,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:23,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:37:23,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:37:23,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:37:23,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:23,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:23,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:37:23,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:37:29,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:37:29,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:37:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:29,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:39,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:39,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-01-18 17:37:39,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:39,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-01-18 17:37:39,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-01-18 17:37:39,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-18 17:37:39,824 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-01-18 17:37:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:47,802 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-01-18 17:37:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:37:47,802 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-01-18 17:37:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:47,803 INFO L225 Difference]: With dead ends: 134 [2019-01-18 17:37:47,803 INFO L226 Difference]: Without dead ends: 133 [2019-01-18 17:37:47,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-18 17:37:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-18 17:37:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-01-18 17:37:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 17:37:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-18 17:37:47,809 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-01-18 17:37:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:47,809 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-18 17:37:47,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-01-18 17:37:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-18 17:37:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-18 17:37:47,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:47,810 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-01-18 17:37:47,810 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-01-18 17:37:47,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:47,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:47,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:47,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:51,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:51,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:51,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:51,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:51,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:51,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:51,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:51,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:51,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:51,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:37:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:37:57,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:37:57,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:37:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:57,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:08,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:08,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-01-18 17:38:08,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:08,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-01-18 17:38:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-01-18 17:38:08,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 17:38:08,055 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-01-18 17:38:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:18,368 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-18 17:38:18,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:38:18,369 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-01-18 17:38:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:18,370 INFO L225 Difference]: With dead ends: 136 [2019-01-18 17:38:18,370 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 17:38:18,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 17:38:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 17:38:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-01-18 17:38:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 17:38:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-01-18 17:38:18,377 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-01-18 17:38:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:18,377 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-01-18 17:38:18,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-01-18 17:38:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-01-18 17:38:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-18 17:38:18,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:18,378 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-01-18 17:38:18,378 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-01-18 17:38:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:18,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:18,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:22,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:22,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:22,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:22,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:22,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:22,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:22,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:22,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:22,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-18 17:38:22,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:22,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:22,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:38:22,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:22,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:22,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:38:29,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:38:29,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:38:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:30,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:41,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:41,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-01-18 17:38:41,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:41,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-18 17:38:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-18 17:38:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-18 17:38:41,068 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-01-18 17:38:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:48,095 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-01-18 17:38:48,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:38:48,095 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-01-18 17:38:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:48,096 INFO L225 Difference]: With dead ends: 138 [2019-01-18 17:38:48,096 INFO L226 Difference]: Without dead ends: 137 [2019-01-18 17:38:48,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-18 17:38:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-18 17:38:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-18 17:38:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-18 17:38:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-18 17:38:48,102 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-01-18 17:38:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:48,102 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-18 17:38:48,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-18 17:38:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-18 17:38:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-18 17:38:48,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:48,103 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-01-18 17:38:48,103 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-01-18 17:38:48,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:48,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:48,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:48,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:51,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:51,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:51,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:51,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:51,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:51,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:51,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:51,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:51,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:51,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:51,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:51,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:38:51,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:38:58,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:38:58,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:58,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:58,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:38:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:58,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:09,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:09,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-01-18 17:39:09,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:09,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-18 17:39:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-18 17:39:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 17:39:09,106 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-01-18 17:39:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:19,313 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-18 17:39:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:39:19,313 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-01-18 17:39:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:19,314 INFO L225 Difference]: With dead ends: 140 [2019-01-18 17:39:19,315 INFO L226 Difference]: Without dead ends: 139 [2019-01-18 17:39:19,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 17:39:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-18 17:39:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-01-18 17:39:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-18 17:39:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-01-18 17:39:19,321 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-01-18 17:39:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:19,321 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-01-18 17:39:19,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-18 17:39:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-01-18 17:39:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-18 17:39:19,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:19,322 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-01-18 17:39:19,322 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-01-18 17:39:19,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:19,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:19,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:23,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:23,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:23,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:23,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:23,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:23,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:23,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:23,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:23,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:23,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:39:23,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:23,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:23,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:39:29,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:39:29,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:29,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:29,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:39:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:29,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:41,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:41,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 209 [2019-01-18 17:39:41,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:41,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-01-18 17:39:41,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-01-18 17:39:41,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=39052, Unknown=0, NotChecked=0, Total=44310 [2019-01-18 17:39:41,193 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 141 states.