java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:16:47,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:16:47,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:16:47,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:16:47,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:16:47,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:16:47,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:16:47,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:16:47,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:16:47,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:16:47,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:16:47,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:16:47,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:16:47,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:16:47,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:16:47,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:16:47,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:16:47,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:16:47,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:16:47,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:16:47,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:16:47,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:16:47,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:16:47,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:16:47,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:16:47,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:16:47,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:16:47,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:16:47,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:16:47,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:16:47,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:16:47,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:16:47,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:16:47,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:16:47,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:16:47,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:16:47,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:16:47,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:16:47,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:16:47,112 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:16:47,112 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:16:47,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:16:47,113 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:16:47,113 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:16:47,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:16:47,113 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:16:47,113 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:16:47,114 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:16:47,114 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:16:47,114 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:16:47,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:16:47,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:16:47,118 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:16:47,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:16:47,118 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:16:47,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:16:47,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:16:47,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:16:47,119 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:16:47,119 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:16:47,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:16:47,122 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:16:47,122 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:16:47,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:16:47,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:16:47,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:16:47,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:16:47,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:16:47,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:16:47,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:16:47,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:16:47,124 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:16:47,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:16:47,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:16:47,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:16:47,124 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:16:47,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:16:47,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:16:47,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:16:47,181 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:16:47,182 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:16:47,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl [2018-12-03 18:16:47,183 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl' [2018-12-03 18:16:47,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:16:47,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:16:47,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:16:47,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:16:47,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:16:47,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,251 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:16:47,251 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:16:47,251 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:16:47,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:16:47,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:16:47,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:16:47,255 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:16:47,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... [2018-12-03 18:16:47,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:16:47,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:16:47,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:16:47,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:16:47,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:16:47,345 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:16:47,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:16:47,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:16:47,553 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:16:47,554 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:16:47,554 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:16:47 BoogieIcfgContainer [2018-12-03 18:16:47,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:16:47,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:16:47,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:16:47,559 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:16:47,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:47" (1/2) ... [2018-12-03 18:16:47,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb2bdc8 and model type Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:16:47, skipping insertion in model container [2018-12-03 18:16:47,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:16:47" (2/2) ... [2018-12-03 18:16:47,563 INFO L112 eAbstractionObserver]: Analyzing ICFG Octopussy.bpl [2018-12-03 18:16:47,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:16:47,582 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:16:47,601 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:16:47,642 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:16:47,642 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:16:47,642 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:16:47,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:16:47,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:16:47,643 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:16:47,643 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:16:47,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:16:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:16:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:16:47,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:47,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:16:47,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:47,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 18:16:47,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:47,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:47,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:16:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:16:47,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:16:47,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:16:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:16:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:16:47,873 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:16:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:47,911 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 18:16:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:16:47,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:16:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:47,925 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:16:47,925 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:16:47,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:16:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:16:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:16:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:16:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:16:47,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:16:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:47,968 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:16:47,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:16:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:16:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:16:47,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:47,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:16:47,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:47,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 18:16:47,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:47,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:47,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:48,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:48,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:48,119 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:16:48,122 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 18:16:48,226 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:16:48,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:16:48,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:16:48,524 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 15 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:16:48,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:48,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:16:48,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:48,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:48,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:48,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:48,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:48,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:48,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:48,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:16:48,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:48,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:16:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:16:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:16:48,751 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 18:16:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:48,783 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:16:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:16:48,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 18:16:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:48,785 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:16:48,785 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:16:48,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:16:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:16:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:16:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:16:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:16:48,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:16:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:48,789 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:16:48,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:16:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:16:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:16:48,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:48,790 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:16:48,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:48,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 18:16:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:48,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:48,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:48,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:48,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:48,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:48,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:48,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:48,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:48,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:48,861 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:48,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:16:48,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:48,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:48,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:48,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:48,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 18:16:48,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:48,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:16:48,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:16:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:16:48,999 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 18:16:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:49,050 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:16:49,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:16:49,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 18:16:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:49,051 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:16:49,051 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:16:49,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:16:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:16:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:16:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:16:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:16:49,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:16:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:49,055 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:16:49,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:16:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:16:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:16:49,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:49,057 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:16:49,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:49,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 18:16:49,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:49,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:49,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:49,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:49,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:49,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:49,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:49,287 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:49,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:49,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:49,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:49,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:49,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:49,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:49,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:49,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:49,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:49,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:16:49,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:49,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:16:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:16:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:16:49,514 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 18:16:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:49,584 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:16:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:16:49,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 18:16:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:49,585 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:16:49,585 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:16:49,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:16:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:16:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:16:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:16:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:16:49,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:16:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:49,590 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:16:49,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:16:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:16:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:16:49,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:49,591 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:16:49,591 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:49,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:49,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 18:16:49,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:49,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:49,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:49,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:49,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:49,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:49,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:49,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:49,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:49,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:49,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:49,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:49,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:49,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:49,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 18:16:49,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:49,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:16:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:16:49,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:16:49,876 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 18:16:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:49,900 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:16:49,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:16:49,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 18:16:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:49,902 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:16:49,902 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:16:49,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:16:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:16:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:16:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:16:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:16:49,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:16:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:49,908 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:16:49,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:16:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:16:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:16:49,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:49,909 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:16:49,909 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:49,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 18:16:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:49,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:49,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:50,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:50,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:50,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:50,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:50,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:50,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:50,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:50,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:16:50,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:50,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:50,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:50,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 18:16:50,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:50,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:16:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:16:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:16:50,511 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 18:16:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:50,558 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:16:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:16:50,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 18:16:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:50,560 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:16:50,560 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:16:50,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:16:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:16:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:16:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:16:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:16:50,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:16:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:50,564 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:16:50,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:16:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:16:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:16:50,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:50,565 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:16:50,565 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:50,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 18:16:50,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:50,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:50,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:50,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:50,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:50,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:50,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:50,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:50,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:50,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:50,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:50,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:50,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:50,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:50,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:51,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 18:16:51,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:51,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:16:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:16:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:16:51,052 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 18:16:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:51,086 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:16:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:16:51,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 18:16:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:51,087 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:16:51,087 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:16:51,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:16:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:16:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:16:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:16:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:16:51,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:16:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:51,091 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:16:51,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:16:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:16:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:16:51,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:51,092 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:16:51,093 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:51,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 18:16:51,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:51,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:51,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:51,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:51,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:51,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:51,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:51,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:51,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:51,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:51,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:51,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:16:51,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:51,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:16:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:16:51,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:16:51,524 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 18:16:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:51,559 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:16:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:16:51,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 18:16:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:51,560 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:16:51,560 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:16:51,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:16:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:16:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:16:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:16:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:16:51,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:16:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:51,564 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:16:51,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:16:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:16:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:16:51,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:51,565 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 18:16:51,565 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:51,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 18:16:51,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:51,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:51,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:51,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:51,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:51,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:51,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:51,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:51,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:51,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:51,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:51,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:16:51,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:51,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 18:16:51,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:51,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:16:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:16:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:16:51,972 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 18:16:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:52,004 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:16:52,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:16:52,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 18:16:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:52,005 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:16:52,005 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:16:52,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:16:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:16:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:16:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:16:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:16:52,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:16:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:52,010 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:16:52,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:16:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:16:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:16:52,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:52,011 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:16:52,011 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:52,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 18:16:52,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:52,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:52,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:52,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:52,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:52,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:52,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:52,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:52,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:52,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:52,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:52,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:52,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:52,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:52,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:52,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:52,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:16:52,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:52,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:16:52,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:16:52,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:16:52,429 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 18:16:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:52,460 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:16:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:16:52,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 18:16:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:52,461 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:16:52,461 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:16:52,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:16:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:16:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:16:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:16:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:16:52,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 18:16:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:52,466 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:16:52,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:16:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:16:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:16:52,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:52,467 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 18:16:52,467 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:52,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 18:16:52,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:52,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:52,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:52,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:52,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:52,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:52,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:52,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:52,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:52,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:52,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:52,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:52,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:53,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:53,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:16:53,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:53,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:16:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:16:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:16:53,161 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 18:16:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:53,184 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 18:16:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:16:53,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 18:16:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:53,186 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:16:53,186 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:16:53,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:16:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:16:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:16:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:16:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:16:53,190 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 18:16:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:53,191 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:16:53,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:16:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:16:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:16:53,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:53,192 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 18:16:53,192 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:53,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 18:16:53,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:53,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:53,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:53,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:53,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:53,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:53,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:53,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:53,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:53,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:53,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:53,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:16:53,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:53,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:53,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:53,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:53,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 18:16:53,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:53,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:16:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:16:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:16:53,987 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 18:16:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:54,024 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:16:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:16:54,025 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 18:16:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:54,026 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:16:54,026 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:16:54,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:16:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:16:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:16:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:16:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:16:54,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 18:16:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:54,029 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:16:54,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:16:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:16:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:16:54,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:54,030 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 18:16:54,030 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:54,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 18:16:54,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:54,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:54,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:54,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:54,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:54,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:54,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:54,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:54,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:54,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:54,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:54,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:54,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:54,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:54,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:16:54,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:54,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:16:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:16:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:16:54,491 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 18:16:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:54,680 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 18:16:54,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:16:54,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 18:16:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:54,682 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:16:54,682 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:16:54,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:16:54,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:16:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:16:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:16:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:16:54,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 18:16:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:54,689 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:16:54,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:16:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:16:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:16:54,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:54,690 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 18:16:54,690 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:54,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 18:16:54,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:54,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:54,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:54,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:54,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:54,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:54,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:54,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:54,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:54,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:54,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:55,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:55,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:16:55,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:55,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:16:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:16:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:16:55,558 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 18:16:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:55,589 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:16:55,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:16:55,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 18:16:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:55,590 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:16:55,590 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:16:55,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:16:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:16:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:16:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:16:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:16:55,594 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 18:16:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:55,595 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:16:55,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:16:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:16:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:16:55,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:55,596 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 18:16:55,596 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:55,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 18:16:55,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:55,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:55,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:55,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:55,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:55,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:55,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:55,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:55,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:55,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:55,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:16:55,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:55,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:55,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:56,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:56,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 18:16:56,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:56,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:16:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:16:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:16:56,460 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 18:16:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:56,500 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 18:16:56,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:16:56,501 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 18:16:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:56,502 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:16:56,502 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:16:56,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:16:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:16:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:16:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:16:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:16:56,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 18:16:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:56,507 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:16:56,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:16:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:16:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:16:56,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:56,508 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 18:16:56,508 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:56,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:56,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 18:16:56,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:56,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:56,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:56,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:56,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:56,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:56,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:56,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:56,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:56,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:56,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:56,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:56,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:56,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:56,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:56,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:56,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:16:57,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:16:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:16:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:16:57,262 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 18:16:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:57,443 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:16:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:16:57,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:16:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:57,449 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:16:57,449 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:16:57,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:16:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:16:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:16:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:16:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:16:57,456 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 18:16:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:57,457 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:16:57,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:16:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:16:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:16:57,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:57,458 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 18:16:57,458 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:57,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 18:16:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:57,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:57,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:58,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:58,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:58,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:58,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:58,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:58,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:58,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:58,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:58,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:58,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:59,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:59,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:16:59,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:59,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:16:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:16:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:16:59,166 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 18:16:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:59,201 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 18:16:59,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:16:59,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 18:16:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:59,202 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:16:59,202 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:16:59,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:16:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:16:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:16:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:16:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:16:59,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 18:16:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:59,208 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:16:59,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:16:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:16:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:16:59,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:59,209 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 18:16:59,209 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:59,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 18:16:59,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:59,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:59,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:59,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:59,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:59,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:59,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:59,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:59,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:59,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:59,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:59,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:16:59,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:59,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:59,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:00,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 18:17:00,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:00,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:17:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:17:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:17:00,449 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 18:17:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:00,484 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:17:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:17:00,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 18:17:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:00,486 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:17:00,486 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:17:00,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:17:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:17:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:17:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:17:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:17:00,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 18:17:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:00,490 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:17:00,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:17:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:17:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:17:00,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:00,491 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 18:17:00,491 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:00,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 18:17:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:00,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:00,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:01,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:01,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:01,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:01,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:01,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:01,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:01,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:01,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:01,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:01,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:01,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:01,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:17:01,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:01,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:17:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:17:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:17:01,666 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 18:17:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:01,697 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 18:17:01,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:17:01,702 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 18:17:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:01,702 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:17:01,702 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:17:01,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:17:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:17:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:17:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:17:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:17:01,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 18:17:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:01,712 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:17:01,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:17:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:17:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:17:01,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:01,713 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 18:17:01,714 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:01,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 18:17:01,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:01,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:01,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:01,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:01,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:01,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:01,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:01,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:01,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:01,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:02,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:02,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:02,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:02,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:17:02,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:02,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:17:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:17:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:17:02,516 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 18:17:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:02,554 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:17:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:17:02,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 18:17:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:02,556 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:17:02,556 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:17:02,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:17:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:17:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:17:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:17:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:17:02,560 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 18:17:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:02,561 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:17:02,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:17:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:17:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:17:02,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:02,562 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 18:17:02,562 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:02,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 18:17:02,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:02,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:02,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:02,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:02,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:02,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:02,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:02,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:02,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:02,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:02,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:02,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 18:17:02,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:02,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:02,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:03,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:03,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 18:17:03,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:03,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:17:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:17:03,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:17:03,678 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 18:17:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:03,738 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 18:17:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:17:03,738 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 18:17:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:03,739 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:17:03,739 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:17:03,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:17:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:17:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:17:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:17:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:17:03,742 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 18:17:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:03,742 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:17:03,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:17:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:17:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:17:03,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:03,743 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 18:17:03,743 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:03,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:03,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 18:17:03,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:03,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:03,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:04,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:04,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:04,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:04,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:04,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:04,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:04,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:04,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:04,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:04,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:04,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:04,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:04,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:04,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:17:04,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:04,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:17:04,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:17:04,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:17:04,860 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 18:17:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:04,902 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:17:04,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:17:04,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 18:17:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:04,906 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:17:04,906 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:17:04,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:17:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:17:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:17:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:17:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:17:04,910 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 18:17:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:04,910 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:17:04,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:17:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:17:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:17:04,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:04,911 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 18:17:04,911 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:04,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 18:17:04,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:04,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:04,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:05,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:05,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:05,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:05,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:05,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:05,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:05,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:05,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:05,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:05,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:05,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:17:05,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:05,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:17:05,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:17:05,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:17:05,834 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 18:17:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:06,037 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 18:17:06,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:17:06,038 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 18:17:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:06,039 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:17:06,039 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:17:06,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:17:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:17:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:17:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:17:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:17:06,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 18:17:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:06,043 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:17:06,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:17:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:17:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:17:06,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:06,044 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 18:17:06,044 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:06,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 18:17:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:06,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:06,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:06,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:06,402 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:06,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:06,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:06,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:06,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:06,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:17:06,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:06,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:06,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:07,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:07,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 18:17:07,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:07,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:17:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:17:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:17:07,165 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 18:17:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:07,209 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:17:07,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:17:07,209 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 18:17:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:07,210 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:17:07,210 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:17:07,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:17:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:17:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:17:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:17:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:17:07,216 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 18:17:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:07,216 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:17:07,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:17:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:17:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:17:07,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:07,217 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 18:17:07,217 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:07,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 18:17:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:07,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:07,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:07,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:07,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:07,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:07,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:07,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:07,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:07,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:07,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:07,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:07,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:07,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:07,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:07,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:08,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:08,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:17:08,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:08,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:17:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:17:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:17:08,649 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 18:17:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:08,697 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 18:17:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:17:08,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 18:17:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:08,698 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:17:08,698 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:17:08,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:17:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:17:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:17:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:17:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:17:08,703 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 18:17:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:08,704 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:17:08,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:17:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:17:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:17:08,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:08,705 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 18:17:08,705 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:08,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 18:17:08,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:08,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:08,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:09,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:09,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:09,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:09,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:09,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:09,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:09,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:09,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:09,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:09,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 18:17:10,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:10,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:17:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:17:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:17:10,305 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 18:17:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:10,340 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:17:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:17:10,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 18:17:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:10,341 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:17:10,341 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:17:10,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:17:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:17:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:17:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:17:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:17:10,345 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 18:17:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:10,346 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:17:10,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:17:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:17:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:17:10,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:10,347 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 18:17:10,347 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:10,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 18:17:10,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:10,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:10,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:11,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:11,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:11,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:11,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:11,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:11,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:11,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:11,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:11,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:17:11,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:11,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:11,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:12,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 18:17:12,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:12,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:17:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:17:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:17:12,411 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 18:17:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:12,557 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 18:17:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:17:12,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 18:17:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:12,558 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:17:12,558 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:17:12,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:17:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:17:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:17:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:17:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:17:12,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 18:17:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:12,563 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:17:12,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:17:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:17:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:17:12,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:12,564 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 18:17:12,564 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:12,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 18:17:12,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:12,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:12,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:12,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:13,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:13,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:13,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:13,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:13,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:13,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:13,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:13,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:13,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:13,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:13,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:14,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:14,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 18:17:14,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:14,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:17:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:17:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:17:14,224 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 18:17:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:14,266 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:17:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:17:14,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 18:17:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:14,267 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:17:14,267 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:17:14,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:17:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:17:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:17:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:17:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:17:14,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 18:17:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:14,272 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:17:14,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:17:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:17:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:17:14,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:14,273 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 18:17:14,273 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:14,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 18:17:14,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:14,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:14,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:14,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:14,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:14,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:14,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:14,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:14,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:14,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:14,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:14,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:14,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:14,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:15,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:15,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 18:17:15,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:15,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:17:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:17:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:17:15,661 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 18:17:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:15,728 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 18:17:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:17:15,729 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 18:17:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:15,729 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:17:15,729 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:17:15,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:17:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:17:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:17:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:17:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:17:15,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 18:17:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:15,734 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:17:15,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:17:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:17:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:17:15,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:15,735 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 18:17:15,735 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:15,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 18:17:15,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:15,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:15,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:16,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:16,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:16,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:16,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:16,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:16,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:16,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:16,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:16,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:17:16,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:16,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:16,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:17,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:17,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 18:17:17,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:17,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:17:17,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:17:17,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:17:17,427 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 18:17:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:17,474 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:17:17,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:17:17,474 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 18:17:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:17,475 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:17:17,475 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:17:17,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:17:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:17:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:17:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:17:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:17:17,479 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 18:17:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:17,479 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:17:17,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:17:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:17:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:17:17,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:17,480 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 18:17:17,480 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:17,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 18:17:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:17,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:17,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:17,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:17,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:17,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:17,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:17,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:17,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:17,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:17,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:17,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:17,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:17,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:17,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 18:17:19,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:19,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:17:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:17:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:17:19,182 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 18:17:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:19,220 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 18:17:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:17:19,221 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 18:17:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:19,222 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:17:19,222 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:17:19,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:17:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:17:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:17:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:17:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:17:19,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 18:17:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:19,227 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:17:19,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:17:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:17:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:17:19,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:19,227 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 18:17:19,228 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:19,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 18:17:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:19,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:19,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:19,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:19,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:19,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:19,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:19,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:19,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:19,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:19,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:19,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:19,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:20,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:20,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 18:17:20,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:20,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:17:20,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:17:20,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:17:20,766 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 18:17:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:20,847 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:17:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:17:20,847 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 18:17:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:20,848 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:17:20,848 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:17:20,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:17:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:17:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:17:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:17:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:17:20,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 18:17:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:20,854 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:17:20,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:17:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:17:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:17:20,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:20,854 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 18:17:20,855 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:20,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 18:17:20,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:20,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:21,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:21,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:21,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:21,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:21,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:21,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:21,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:21,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:21,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 18:17:21,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:21,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:21,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:22,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:22,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 18:17:22,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:22,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:17:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:17:22,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:17:22,910 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 18:17:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:22,986 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 18:17:22,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:17:22,986 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 18:17:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:22,987 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:17:22,987 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:17:22,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:17:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:17:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:17:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:17:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:17:22,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 18:17:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:22,992 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:17:22,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:17:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:17:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:17:22,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:22,992 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 18:17:22,993 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:22,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 18:17:22,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:22,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:22,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:23,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:23,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:23,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:23,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:23,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:23,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:23,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:23,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:23,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:23,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:23,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:24,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:24,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 18:17:24,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:24,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:17:24,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:17:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:17:24,811 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 18:17:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:24,896 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:17:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:17:24,896 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 18:17:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:24,897 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:17:24,897 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:17:24,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:17:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:17:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:17:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:17:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:17:24,901 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 18:17:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:24,901 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:17:24,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:17:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:17:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:17:24,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:24,901 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 18:17:24,902 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:24,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 18:17:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:24,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:24,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:25,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:25,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:25,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:25,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:25,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:25,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:25,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:25,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:25,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:26,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:26,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 18:17:26,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:26,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:17:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:17:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:17:26,989 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 18:17:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:27,058 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 18:17:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:17:27,059 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 18:17:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:27,059 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:17:27,060 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:17:27,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:17:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:17:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:17:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:17:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:17:27,065 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 18:17:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:27,066 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:17:27,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:17:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:17:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:17:27,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:27,067 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 18:17:27,067 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:27,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 18:17:27,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:27,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:27,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:27,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:27,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:27,688 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:27,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:27,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:27,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:27,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:27,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 18:17:27,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:27,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:27,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:29,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:29,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 18:17:29,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:29,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:17:29,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:17:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:17:29,183 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 18:17:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:29,234 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:17:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:17:29,235 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 18:17:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:29,236 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:17:29,236 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:17:29,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:17:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:17:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:17:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:17:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:17:29,239 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 18:17:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:29,239 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:17:29,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:17:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:17:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:17:29,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:29,240 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 18:17:29,240 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:29,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 18:17:29,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:29,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:29,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:29,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:29,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:29,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:29,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:29,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:29,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:29,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:29,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:29,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:29,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:29,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:29,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:29,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:29,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:31,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:31,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 18:17:31,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:31,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:17:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:17:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:17:31,423 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 18:17:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:31,478 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 18:17:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:17:31,479 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 18:17:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:31,479 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:17:31,479 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:17:31,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:17:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:17:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:17:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:17:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:17:31,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 18:17:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:31,483 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:17:31,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:17:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:17:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:17:31,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:31,484 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 18:17:31,484 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:31,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:31,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 18:17:31,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:31,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:31,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:31,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:32,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:32,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:32,266 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:32,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:32,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:32,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:32,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:32,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:32,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 18:17:34,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:34,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:17:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:17:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:17:34,029 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 18:17:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:34,092 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:17:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:17:34,092 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 18:17:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:34,093 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:17:34,093 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:17:34,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:17:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:17:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:17:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:17:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:17:34,097 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 18:17:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:34,097 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:17:34,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:17:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:17:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:17:34,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:34,098 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 18:17:34,099 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:34,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 18:17:34,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:34,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:34,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:34,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:34,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:34,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:34,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:34,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:34,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:34,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:34,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:34,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:17:34,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:34,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:34,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:36,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:36,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 18:17:36,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:17:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:17:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:17:36,493 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 18:17:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:36,559 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 18:17:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:17:36,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 18:17:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:36,560 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:17:36,560 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:17:36,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:17:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:17:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:17:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:17:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:17:36,565 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 18:17:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:36,565 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:17:36,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:17:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:17:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:17:36,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:36,566 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 18:17:36,566 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:36,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 18:17:36,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:36,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:36,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:37,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:37,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:37,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:37,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:37,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:37,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:37,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:37,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:37,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:37,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:37,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:37,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:39,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:39,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 18:17:39,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:39,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:17:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:17:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:17:39,324 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 18:17:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:39,369 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:17:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:17:39,370 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 18:17:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:39,371 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:17:39,371 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:17:39,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:17:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:17:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:17:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:17:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:17:39,374 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 18:17:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:39,374 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:17:39,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:17:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:17:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:17:39,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:39,375 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 18:17:39,375 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:39,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 18:17:39,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:39,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:39,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:39,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:39,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:39,992 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:39,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:39,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:39,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:40,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:40,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:40,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:40,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:41,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 18:17:41,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:41,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:17:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:17:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:17:41,794 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 18:17:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:41,925 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 18:17:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:17:41,926 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 18:17:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:41,926 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:17:41,926 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:17:41,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:17:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:17:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:17:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:17:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:17:41,928 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 18:17:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:41,928 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:17:41,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:17:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:17:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:17:41,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:41,929 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 18:17:41,929 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:41,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 18:17:41,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:41,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:41,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:42,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:42,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:42,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:42,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:42,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:42,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:42,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:42,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:43,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:17:43,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:43,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:43,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:44,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:44,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 18:17:44,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:44,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:17:44,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:17:44,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:17:44,873 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 18:17:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:44,936 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 18:17:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:17:44,936 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 18:17:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:44,937 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:17:44,937 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:17:44,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:17:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:17:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:17:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:17:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 18:17:44,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 18:17:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:44,941 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 18:17:44,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:17:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 18:17:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:17:44,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:44,941 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 18:17:44,941 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:44,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 18:17:44,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:44,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:44,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:45,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:45,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:45,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:45,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:45,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:45,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:45,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:45,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:45,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:45,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:45,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:45,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:48,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:48,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 18:17:48,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:48,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:17:48,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:17:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:17:48,064 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 18:17:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:48,115 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 18:17:48,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:17:48,116 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 18:17:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:48,117 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:17:48,117 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:17:48,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:17:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:17:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:17:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:17:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 18:17:48,121 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 18:17:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:48,121 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 18:17:48,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:17:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 18:17:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:17:48,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:48,122 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 18:17:48,122 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:48,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 18:17:48,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:48,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:48,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:48,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:48,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:48,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:48,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:48,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:48,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:48,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:49,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:49,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:51,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:51,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 18:17:51,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:51,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:17:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:17:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:17:51,025 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 18:17:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:51,164 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 18:17:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:17:51,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 18:17:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:51,165 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:17:51,166 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:17:51,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:17:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:17:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 18:17:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:17:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 18:17:51,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 18:17:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:51,170 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 18:17:51,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:17:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 18:17:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:17:51,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:51,171 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 18:17:51,171 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:51,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 18:17:51,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:51,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:51,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:52,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:52,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:52,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:52,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:52,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:52,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:52,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:52,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 18:17:52,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:52,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:52,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:54,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:54,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 18:17:54,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:54,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:17:54,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:17:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:17:54,446 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 18:17:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:54,498 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 18:17:54,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:17:54,498 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 18:17:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:54,499 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:17:54,499 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:17:54,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:17:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:17:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 18:17:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:17:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 18:17:54,502 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 18:17:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:54,503 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 18:17:54,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:17:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 18:17:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 18:17:54,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:54,504 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 18:17:54,504 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:54,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:54,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 18:17:54,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:54,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:54,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:54,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:54,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:55,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:55,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:55,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:55,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:55,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:55,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:55,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:55,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:55,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:55,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:55,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:55,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:57,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:57,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 18:17:57,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:57,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:17:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:17:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:17:57,897 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 18:17:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:58,185 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 18:17:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:17:58,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 18:17:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:58,186 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:17:58,187 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:17:58,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:17:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:17:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:17:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:17:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 18:17:58,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 18:17:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:58,190 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 18:17:58,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:17:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 18:17:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:17:58,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:58,191 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 18:17:58,191 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:58,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 18:17:58,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:58,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:58,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:58,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:59,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:59,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:59,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:59,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:59,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:59,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:59,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:59,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:59,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:01,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:01,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 18:18:01,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:01,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:18:01,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:18:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:18:01,742 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 18:18:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:01,827 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 18:18:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:18:01,828 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 18:18:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:01,828 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:18:01,829 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:18:01,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:18:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:18:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:18:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:18:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:18:01,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 18:18:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:01,832 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:18:01,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:18:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:18:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:18:01,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:01,833 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 18:18:01,833 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:01,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 18:18:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:01,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:03,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:03,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:03,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:03,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:03,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:03,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:03,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:03,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:03,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 18:18:03,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:03,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:03,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:05,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 18:18:05,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:05,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:18:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:18:05,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:18:05,582 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 18:18:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:05,655 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 18:18:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:18:05,662 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 18:18:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:05,662 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:18:05,663 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:18:05,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:18:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:18:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:18:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:18:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 18:18:05,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 18:18:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:05,666 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 18:18:05,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:18:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 18:18:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:18:05,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:05,666 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 18:18:05,667 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:05,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 18:18:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:05,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:05,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:06,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:06,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:06,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:06,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:06,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:06,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:06,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:06,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:06,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:06,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:06,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 18:18:09,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:18:09,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:18:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:18:09,323 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 18:18:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:09,454 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 18:18:09,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:18:09,455 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 18:18:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:09,455 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:18:09,456 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:18:09,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:18:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:18:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:18:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:18:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:18:09,460 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 18:18:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:09,460 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:18:09,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:18:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:18:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:18:09,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:09,461 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 18:18:09,461 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:09,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:09,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 18:18:09,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:09,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:09,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:09,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:11,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:11,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:11,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:11,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:11,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:11,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:11,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:11,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:11,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:11,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:14,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:14,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 18:18:14,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:14,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:18:14,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:18:14,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:18:14,788 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 18:18:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:14,863 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 18:18:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:18:14,863 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 18:18:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:14,864 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:18:14,864 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:18:14,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:18:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:18:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:18:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:18:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 18:18:14,868 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 18:18:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:14,868 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 18:18:14,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:18:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 18:18:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:18:14,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:14,868 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 18:18:14,868 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:14,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 18:18:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:14,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:15,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:15,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:15,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:15,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:15,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:15,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:15,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:15,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:15,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:18:15,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:15,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:15,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:19,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:19,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 18:18:19,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:19,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:18:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:18:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:18:19,031 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 18:18:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:19,197 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 18:18:19,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:18:19,197 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 18:18:19,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:19,199 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:18:19,199 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:18:19,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:18:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:18:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 18:18:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 18:18:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 18:18:19,202 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 18:18:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:19,202 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 18:18:19,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:18:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 18:18:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:18:19,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:19,203 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 18:18:19,203 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:19,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-12-03 18:18:19,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:19,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:19,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:19,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:19,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:20,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:20,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:20,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:20,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:20,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:20,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:20,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:20,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:20,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:20,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:20,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:23,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:23,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 18:18:23,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:23,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 18:18:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 18:18:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:18:23,542 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 18:18:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:23,625 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 18:18:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:18:23,626 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 18:18:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:23,627 INFO L225 Difference]: With dead ends: 58 [2018-12-03 18:18:23,627 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 18:18:23,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:18:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 18:18:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 18:18:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:18:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 18:18:23,631 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 18:18:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:23,631 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 18:18:23,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 18:18:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 18:18:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:18:23,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:23,632 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 18:18:23,632 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:23,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-12-03 18:18:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:23,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:23,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:23,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:24,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:24,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:24,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:24,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:24,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:24,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:24,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:27,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:27,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 18:18:27,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:27,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:18:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:18:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:18:27,563 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 18:18:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:27,643 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 18:18:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:18:27,644 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 18:18:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:27,644 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:18:27,644 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:18:27,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:18:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:18:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 18:18:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:18:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 18:18:27,648 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 18:18:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:27,648 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 18:18:27,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:18:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 18:18:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:18:27,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:27,649 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 18:18:27,649 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:27,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-12-03 18:18:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:27,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:29,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:29,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:29,019 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:29,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:29,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:29,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:29,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:29,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:29,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 18:18:29,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:29,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:29,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:32,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:32,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 18:18:32,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:32,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:18:32,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:18:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:18:32,084 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 18:18:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:32,170 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 18:18:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:18:32,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 18:18:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:32,171 INFO L225 Difference]: With dead ends: 60 [2018-12-03 18:18:32,171 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:18:32,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:18:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:18:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 18:18:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:18:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 18:18:32,175 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 18:18:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:32,175 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 18:18:32,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:18:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 18:18:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:18:32,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:32,175 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 18:18:32,176 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:32,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-12-03 18:18:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:32,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:32,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:33,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:33,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:33,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:33,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:33,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:33,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:33,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:33,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:33,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:33,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:33,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:33,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:36,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 18:18:36,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:18:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:18:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:18:36,765 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 18:18:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:36,830 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 18:18:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:18:36,830 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 18:18:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:36,831 INFO L225 Difference]: With dead ends: 61 [2018-12-03 18:18:36,831 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:18:36,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:18:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:18:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 18:18:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 18:18:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 18:18:36,834 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 18:18:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:36,834 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 18:18:36,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:18:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 18:18:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 18:18:36,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:36,835 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 18:18:36,835 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:36,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-12-03 18:18:36,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:36,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:36,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:38,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:38,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:38,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:38,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:38,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:38,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:38,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:38,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:38,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:41,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:41,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 18:18:41,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:41,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 18:18:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 18:18:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:18:41,552 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 18:18:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:41,663 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 18:18:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 18:18:41,663 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 18:18:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:41,664 INFO L225 Difference]: With dead ends: 62 [2018-12-03 18:18:41,664 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:18:41,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:18:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:18:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 18:18:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:18:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 18:18:41,668 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 18:18:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:41,668 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 18:18:41,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 18:18:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 18:18:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:18:41,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:41,669 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 18:18:41,669 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:41,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-12-03 18:18:41,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:41,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:41,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:42,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:42,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:42,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:42,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:42,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:42,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:42,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:42,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:42,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 18:18:42,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:42,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:42,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:46,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:46,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 18:18:46,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:46,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:18:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:18:46,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:18:46,658 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 18:18:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:46,744 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 18:18:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:18:46,745 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 18:18:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:46,745 INFO L225 Difference]: With dead ends: 63 [2018-12-03 18:18:46,745 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 18:18:46,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:18:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 18:18:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 18:18:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 18:18:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 18:18:46,749 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 18:18:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:46,750 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 18:18:46,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:18:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 18:18:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 18:18:46,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:46,751 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 18:18:46,751 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:46,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-12-03 18:18:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:46,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:46,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:47,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:47,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:47,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:47,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:47,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:47,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:48,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:48,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:48,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:48,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:48,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:51,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 18:18:51,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:51,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:18:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:18:51,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:18:51,647 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 18:18:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:51,734 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 18:18:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:18:51,734 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 18:18:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:51,735 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:18:51,735 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 18:18:51,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:18:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 18:18:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 18:18:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 18:18:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 18:18:51,739 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 18:18:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:51,739 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 18:18:51,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:18:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 18:18:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 18:18:51,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:51,739 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 18:18:51,740 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:51,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-12-03 18:18:51,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:51,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:51,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:53,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:53,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:53,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:53,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:53,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:53,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:53,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:53,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:53,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:53,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:57,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 18:18:57,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:57,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:18:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:18:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:18:57,146 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 18:18:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:57,243 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 18:18:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 18:18:57,244 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 18:18:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:57,244 INFO L225 Difference]: With dead ends: 65 [2018-12-03 18:18:57,244 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:18:57,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:18:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:18:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 18:18:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 18:18:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 18:18:57,249 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 18:18:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:57,249 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 18:18:57,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:18:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 18:18:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 18:18:57,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:57,250 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 18:18:57,250 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:57,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-12-03 18:18:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:57,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:57,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:00,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:00,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:00,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:00,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:00,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:00,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:00,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:00,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 18:19:00,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:00,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:00,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 18:19:04,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:04,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 18:19:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 18:19:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:19:04,637 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 18:19:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:04,733 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 18:19:04,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 18:19:04,734 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 18:19:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:04,734 INFO L225 Difference]: With dead ends: 66 [2018-12-03 18:19:04,735 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 18:19:04,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:19:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 18:19:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 18:19:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:19:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 18:19:04,739 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 18:19:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:04,739 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 18:19:04,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 18:19:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 18:19:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:19:04,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:04,739 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 18:19:04,740 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:04,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:04,740 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-12-03 18:19:04,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:04,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:04,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:04,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:06,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:06,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:06,774 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:06,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:06,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:06,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:06,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:06,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:06,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:06,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:06,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:06,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:10,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 18:19:10,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:10,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:19:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:19:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:19:10,852 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 18:19:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:10,948 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 18:19:10,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:19:10,948 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 18:19:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:10,949 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:19:10,949 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 18:19:10,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:19:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 18:19:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 18:19:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 18:19:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 18:19:10,953 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 18:19:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:10,953 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 18:19:10,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:19:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 18:19:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 18:19:10,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:10,954 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 18:19:10,954 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:10,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-12-03 18:19:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:10,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:10,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:12,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:12,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:12,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:12,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:12,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:12,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:12,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:12,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:12,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:16,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:16,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 18:19:16,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:16,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:19:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:19:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:19:16,515 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 18:19:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:16,634 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 18:19:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:19:16,634 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 18:19:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:16,635 INFO L225 Difference]: With dead ends: 68 [2018-12-03 18:19:16,635 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 18:19:16,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:19:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 18:19:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 18:19:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:19:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 18:19:16,638 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 18:19:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:16,639 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 18:19:16,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:19:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 18:19:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:19:16,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:16,639 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 18:19:16,640 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:16,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-12-03 18:19:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:16,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:16,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:18,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:18,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:18,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:18,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:18,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:18,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:18,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:18,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:18,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 18:19:18,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:18,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:18,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:22,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:22,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 18:19:22,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:19:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:19:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:19:22,528 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 18:19:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:22,685 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 18:19:22,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:19:22,685 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 18:19:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:22,686 INFO L225 Difference]: With dead ends: 69 [2018-12-03 18:19:22,686 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 18:19:22,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:19:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 18:19:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 18:19:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 18:19:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 18:19:22,690 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 18:19:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:22,691 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 18:19:22,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:19:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 18:19:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 18:19:22,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:22,691 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 18:19:22,692 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:22,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-12-03 18:19:22,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:22,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:24,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:24,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:24,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:24,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:24,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:24,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:24,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:24,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:24,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:24,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:24,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:24,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:28,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:28,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 18:19:28,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:28,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 18:19:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 18:19:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:19:28,594 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 18:19:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:28,680 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 18:19:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 18:19:28,680 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 18:19:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:28,681 INFO L225 Difference]: With dead ends: 70 [2018-12-03 18:19:28,681 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:19:28,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:19:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:19:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:19:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:19:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 18:19:28,685 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 18:19:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:28,686 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 18:19:28,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 18:19:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 18:19:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:19:28,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:28,686 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 18:19:28,687 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-12-03 18:19:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:28,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:28,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:30,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:30,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:30,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:30,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:30,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:30,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 18:19:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:30,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:30,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:30,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:35,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:35,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 18:19:35,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:35,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:19:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:19:35,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:19:35,244 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 18:19:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:35,508 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 18:19:35,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:19:35,508 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 18:19:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:35,509 INFO L225 Difference]: With dead ends: 71 [2018-12-03 18:19:35,509 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:19:35,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:19:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:19:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 18:19:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:19:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 18:19:35,513 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 18:19:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:35,513 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 18:19:35,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:19:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 18:19:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 18:19:35,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:35,514 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 18:19:35,514 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:35,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-12-03 18:19:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:35,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:35,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:37,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:37,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:37,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:37,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:37,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:37,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 18:19:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:37,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:37,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 18:19:37,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:37,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:37,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:42,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:42,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 18:19:42,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:42,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:19:42,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:19:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:19:42,413 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 18:19:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:42,526 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 18:19:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:19:42,527 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 18:19:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:42,527 INFO L225 Difference]: With dead ends: 72 [2018-12-03 18:19:42,527 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 18:19:42,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:19:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 18:19:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 18:19:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:19:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 18:19:42,531 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 18:19:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:42,531 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 18:19:42,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:19:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 18:19:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 18:19:42,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:42,532 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 18:19:42,532 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:42,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-12-03 18:19:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:42,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:42,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:44,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:44,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:44,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:44,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:44,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:44,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 18:19:44,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:44,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:44,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:44,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:44,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:44,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:50,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 18:19:50,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:50,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:19:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:19:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:19:50,047 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 18:19:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:50,193 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 18:19:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:19:50,193 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 18:19:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:50,194 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:19:50,194 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 18:19:50,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:19:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 18:19:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 18:19:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 18:19:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 18:19:50,198 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 18:19:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:50,198 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 18:19:50,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:19:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 18:19:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 18:19:50,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:50,199 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 18:19:50,200 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:50,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:50,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-12-03 18:19:50,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:50,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:50,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:50,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:50,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:51,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:51,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:51,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:51,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:51,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:51,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 18:19:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:51,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:51,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:51,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:56,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:56,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 18:19:56,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:56,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 18:19:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 18:19:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:19:56,877 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 18:19:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:56,988 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 18:19:56,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:19:56,988 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 18:19:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:56,989 INFO L225 Difference]: With dead ends: 74 [2018-12-03 18:19:56,989 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 18:19:56,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:19:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 18:19:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 18:19:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 18:19:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 18:19:56,993 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 18:19:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:56,993 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 18:19:56,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 18:19:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 18:19:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:19:56,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:56,994 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 18:19:56,995 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:56,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-12-03 18:19:56,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:56,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:58,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:58,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:58,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:58,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:58,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:58,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:58,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:58,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:58,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 18:19:58,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:58,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:58,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:04,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:04,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 18:20:04,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:04,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:20:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:20:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:20:04,025 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 18:20:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:04,112 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 18:20:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 18:20:04,112 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 18:20:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:04,113 INFO L225 Difference]: With dead ends: 75 [2018-12-03 18:20:04,113 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:20:04,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:20:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:20:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 18:20:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 18:20:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 18:20:04,117 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 18:20:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:04,117 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 18:20:04,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:20:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 18:20:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 18:20:04,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:04,118 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 18:20:04,118 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:04,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-12-03 18:20:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:04,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:04,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:06,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:06,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:06,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:06,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:06,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:06,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:06,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:06,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:06,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:06,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:06,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:06,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:11,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:11,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 18:20:11,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:11,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 18:20:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 18:20:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:20:11,543 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 18:20:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:11,685 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 18:20:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 18:20:11,686 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 18:20:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:11,687 INFO L225 Difference]: With dead ends: 76 [2018-12-03 18:20:11,687 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 18:20:11,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:20:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 18:20:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 18:20:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:20:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 18:20:11,691 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 18:20:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:11,692 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 18:20:11,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 18:20:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 18:20:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:20:11,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:11,693 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 18:20:11,693 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:11,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-12-03 18:20:11,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:11,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:11,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:13,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:13,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:13,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:13,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:13,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:13,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:13,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:13,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:13,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:19,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 18:20:19,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:19,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 18:20:19,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 18:20:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:20:19,320 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 18:20:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:19,550 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 18:20:19,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 18:20:19,550 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 18:20:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:19,551 INFO L225 Difference]: With dead ends: 77 [2018-12-03 18:20:19,551 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 18:20:19,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:20:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 18:20:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 18:20:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 18:20:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 18:20:19,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 18:20:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:19,556 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 18:20:19,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 18:20:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 18:20:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 18:20:19,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:19,557 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 18:20:19,557 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:19,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-12-03 18:20:19,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:19,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:19,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:21,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:21,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:21,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:21,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:21,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:21,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:21,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:21,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:21,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 18:20:21,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:21,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:21,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:27,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:27,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 18:20:27,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:27,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 18:20:27,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 18:20:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 18:20:27,404 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 18:20:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:27,501 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 18:20:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 18:20:27,502 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 18:20:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:27,503 INFO L225 Difference]: With dead ends: 78 [2018-12-03 18:20:27,503 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 18:20:27,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 18:20:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 18:20:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 18:20:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:20:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 18:20:27,507 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 18:20:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:27,508 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 18:20:27,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 18:20:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 18:20:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:20:27,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:27,509 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 18:20:27,509 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:27,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-12-03 18:20:27,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:27,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:27,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:27,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:27,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:29,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:29,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:29,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:29,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:29,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:29,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:29,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:29,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:29,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:29,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:29,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:29,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:35,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:35,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 18:20:35,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 18:20:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 18:20:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:20:35,237 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 18:20:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:35,339 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 18:20:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 18:20:35,339 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 18:20:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:35,340 INFO L225 Difference]: With dead ends: 79 [2018-12-03 18:20:35,340 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 18:20:35,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:20:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 18:20:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 18:20:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 18:20:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 18:20:35,344 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 18:20:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:35,345 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 18:20:35,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 18:20:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 18:20:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 18:20:35,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:35,345 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 18:20:35,346 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:35,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-12-03 18:20:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:35,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:35,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:37,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:37,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:37,495 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:37,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:37,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:37,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:37,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:37,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:37,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:37,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:43,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 18:20:43,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:43,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 18:20:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 18:20:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 18:20:43,478 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 18:20:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:43,576 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 18:20:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 18:20:43,577 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 18:20:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:43,577 INFO L225 Difference]: With dead ends: 80 [2018-12-03 18:20:43,578 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 18:20:43,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 18:20:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 18:20:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 18:20:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 18:20:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 18:20:43,581 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 18:20:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:43,581 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 18:20:43,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 18:20:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 18:20:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 18:20:43,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:43,582 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 18:20:43,583 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:43,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-12-03 18:20:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:43,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:43,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:45,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:45,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:45,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:45,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:45,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:45,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:45,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:45,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 18:20:45,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:45,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:45,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:51,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 18:20:51,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:51,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 18:20:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 18:20:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 18:20:51,972 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 18:20:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:52,077 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 18:20:52,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 18:20:52,077 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 18:20:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:52,078 INFO L225 Difference]: With dead ends: 81 [2018-12-03 18:20:52,078 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 18:20:52,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 18:20:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 18:20:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 18:20:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 18:20:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 18:20:52,082 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 18:20:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:52,083 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 18:20:52,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 18:20:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 18:20:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 18:20:52,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:52,083 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 18:20:52,084 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:52,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-12-03 18:20:52,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:52,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:52,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:54,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:54,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:54,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:54,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:54,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:54,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:20:54,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:54,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:54,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:54,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:54,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:54,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:00,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 18:21:00,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:00,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 18:21:00,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 18:21:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:21:00,417 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 18:21:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:00,552 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 18:21:00,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 18:21:00,553 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 18:21:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:00,553 INFO L225 Difference]: With dead ends: 82 [2018-12-03 18:21:00,553 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 18:21:00,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:21:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 18:21:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 18:21:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 18:21:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 18:21:00,557 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 18:21:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:00,557 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 18:21:00,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 18:21:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 18:21:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 18:21:00,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:00,558 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 18:21:00,558 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:00,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-12-03 18:21:00,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:00,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:00,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:00,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:02,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:02,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:02,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:02,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:02,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:02,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:02,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:21:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:02,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:02,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:09,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:09,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 18:21:09,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:09,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:21:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:21:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 18:21:09,157 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 18:21:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:10,572 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 18:21:10,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 18:21:10,572 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 18:21:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:10,572 INFO L225 Difference]: With dead ends: 83 [2018-12-03 18:21:10,572 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 18:21:10,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 18:21:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 18:21:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 18:21:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 18:21:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 18:21:10,575 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 18:21:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:10,576 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 18:21:10,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:21:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 18:21:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 18:21:10,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:10,577 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 18:21:10,577 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:10,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-12-03 18:21:10,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:10,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:10,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:10,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:13,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:13,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:13,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:13,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:13,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:13,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:13,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:21:13,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:21:13,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 18:21:13,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:13,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:13,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:19,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:19,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 18:21:19,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:19,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 18:21:19,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 18:21:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 18:21:19,793 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 18:21:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:20,501 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 18:21:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 18:21:20,501 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 18:21:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:20,502 INFO L225 Difference]: With dead ends: 84 [2018-12-03 18:21:20,502 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 18:21:20,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 18:21:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 18:21:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 18:21:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 18:21:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 18:21:20,505 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 18:21:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:20,505 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 18:21:20,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 18:21:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 18:21:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:21:20,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:20,506 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 18:21:20,506 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:20,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:20,507 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-12-03 18:21:20,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:20,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:20,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:22,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:22,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:22,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:22,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:22,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:22,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:22,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:22,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:23,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:23,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:23,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:23,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:29,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:29,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 18:21:29,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:29,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 18:21:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 18:21:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:21:29,665 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 18:21:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:29,830 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 18:21:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 18:21:29,831 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 18:21:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:29,832 INFO L225 Difference]: With dead ends: 85 [2018-12-03 18:21:29,832 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 18:21:29,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:21:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 18:21:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 18:21:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 18:21:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 18:21:29,836 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 18:21:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:29,836 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 18:21:29,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 18:21:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 18:21:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 18:21:29,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:29,837 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 18:21:29,838 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:29,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-12-03 18:21:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:29,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:29,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:32,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:32,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:32,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:32,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:32,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:32,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:32,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:32,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:21:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:32,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:32,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:38,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:38,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 18:21:38,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:38,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 18:21:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 18:21:38,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:21:38,891 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 18:21:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:38,996 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 18:21:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 18:21:38,997 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 18:21:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:38,998 INFO L225 Difference]: With dead ends: 86 [2018-12-03 18:21:38,998 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 18:21:38,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:21:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 18:21:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 18:21:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 18:21:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 18:21:39,001 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 18:21:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:39,001 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 18:21:39,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 18:21:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 18:21:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 18:21:39,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:39,002 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 18:21:39,002 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:39,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-12-03 18:21:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:39,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:41,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:41,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:41,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:41,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:41,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:41,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:41,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:21:41,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:21:41,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 18:21:41,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:41,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:41,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 18:21:48,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:48,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 18:21:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 18:21:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 18:21:48,623 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 18:21:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:48,785 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 18:21:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 18:21:48,786 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 18:21:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:48,787 INFO L225 Difference]: With dead ends: 87 [2018-12-03 18:21:48,787 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 18:21:48,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 18:21:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 18:21:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 18:21:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 18:21:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 18:21:48,790 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 18:21:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:48,791 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 18:21:48,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 18:21:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 18:21:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 18:21:48,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:48,791 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 18:21:48,791 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:48,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-12-03 18:21:48,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:48,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:48,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:51,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:51,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:51,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:51,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:51,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:51,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:51,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:51,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:51,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:51,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:51,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:51,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:58,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:58,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 18:21:58,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:58,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 18:21:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 18:21:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:21:58,980 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 18:21:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:59,153 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 18:21:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 18:21:59,153 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 18:21:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:59,154 INFO L225 Difference]: With dead ends: 88 [2018-12-03 18:21:59,154 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 18:21:59,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:21:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 18:21:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 18:21:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 18:21:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 18:21:59,158 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 18:21:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:59,159 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 18:21:59,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 18:21:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 18:21:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 18:21:59,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:59,160 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 18:21:59,160 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:59,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:59,160 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-12-03 18:21:59,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:59,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:59,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:01,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:01,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:01,609 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:01,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:01,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:01,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:01,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:01,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:22:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:01,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:01,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:09,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:09,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 18:22:09,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:09,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:22:09,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:22:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 18:22:09,262 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 18:22:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:09,408 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 18:22:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 18:22:09,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 18:22:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:09,410 INFO L225 Difference]: With dead ends: 89 [2018-12-03 18:22:09,410 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 18:22:09,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 18:22:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 18:22:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 18:22:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 18:22:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 18:22:09,413 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 18:22:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:09,414 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 18:22:09,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:22:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 18:22:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 18:22:09,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:09,414 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 18:22:09,414 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:09,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-12-03 18:22:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:09,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:09,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:11,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:11,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:11,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:11,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:11,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:11,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:11,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:22:11,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:22:12,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 18:22:12,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:12,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:12,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:19,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:19,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 18:22:19,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:19,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 18:22:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 18:22:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 18:22:19,700 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 18:22:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:19,848 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 18:22:19,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 18:22:19,848 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 18:22:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:19,849 INFO L225 Difference]: With dead ends: 90 [2018-12-03 18:22:19,849 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 18:22:19,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 18:22:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 18:22:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 18:22:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:22:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 18:22:19,853 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 18:22:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:19,853 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 18:22:19,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 18:22:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 18:22:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:22:19,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:19,854 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 18:22:19,854 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:19,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-12-03 18:22:19,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:19,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:19,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:22,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:22,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:22,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:22,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:22,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:22,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:22,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:22:22,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:22:22,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:22:22,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:22,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:22,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:30,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:30,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 18:22:30,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:30,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 18:22:30,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 18:22:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:22:30,168 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 18:22:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:30,326 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 18:22:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 18:22:30,327 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 18:22:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:30,328 INFO L225 Difference]: With dead ends: 91 [2018-12-03 18:22:30,328 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 18:22:30,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:22:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 18:22:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 18:22:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 18:22:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 18:22:30,332 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 18:22:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:30,332 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 18:22:30,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 18:22:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 18:22:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 18:22:30,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:30,333 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 18:22:30,333 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:30,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-12-03 18:22:30,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:30,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:30,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:32,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:32,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:32,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:32,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:32,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:32,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:32,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:32,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:22:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:32,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:32,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:40,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:40,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 18:22:40,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:40,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 18:22:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 18:22:40,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 18:22:40,718 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 18:22:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:40,900 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 18:22:40,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:22:40,900 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 18:22:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:40,901 INFO L225 Difference]: With dead ends: 92 [2018-12-03 18:22:40,901 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 18:22:40,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 18:22:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 18:22:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 18:22:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 18:22:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 18:22:40,905 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 18:22:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:40,905 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 18:22:40,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 18:22:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 18:22:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 18:22:40,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:40,906 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 18:22:40,906 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:40,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-12-03 18:22:40,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:40,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:43,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:43,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:43,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:43,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:43,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:43,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:43,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:22:43,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:22:43,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 18:22:43,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:43,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:43,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:51,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:51,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 18:22:51,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:51,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 18:22:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 18:22:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 18:22:51,607 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 18:22:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:51,804 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 18:22:51,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 18:22:51,805 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 18:22:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:51,806 INFO L225 Difference]: With dead ends: 93 [2018-12-03 18:22:51,806 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 18:22:51,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 18:22:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 18:22:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 18:22:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 18:22:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 18:22:51,809 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 18:22:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:51,810 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 18:22:51,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 18:22:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 18:22:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 18:22:51,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:51,810 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 18:22:51,810 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:51,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-12-03 18:22:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:51,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:51,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:54,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:54,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:54,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:54,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:54,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:54,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:54,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:22:54,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:22:54,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:22:54,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:54,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:54,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:02,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:02,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 18:23:02,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:02,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 18:23:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 18:23:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:23:02,618 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 18:23:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:02,740 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 18:23:02,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 18:23:02,741 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 18:23:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:02,742 INFO L225 Difference]: With dead ends: 94 [2018-12-03 18:23:02,742 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 18:23:02,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:23:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 18:23:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 18:23:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 18:23:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 18:23:02,746 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 18:23:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:02,746 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 18:23:02,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 18:23:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 18:23:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:23:02,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:02,747 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 18:23:02,747 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:02,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-12-03 18:23:02,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:02,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:02,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:02,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:02,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:05,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:05,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:05,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:05,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:05,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:05,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:05,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:23:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:05,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:05,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:13,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 18:23:13,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:13,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 18:23:13,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 18:23:13,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 18:23:13,460 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 18:23:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:13,647 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 18:23:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 18:23:13,648 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 18:23:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:13,648 INFO L225 Difference]: With dead ends: 95 [2018-12-03 18:23:13,649 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 18:23:13,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 18:23:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 18:23:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 18:23:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 18:23:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 18:23:13,653 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 18:23:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:13,653 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 18:23:13,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 18:23:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 18:23:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 18:23:13,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:13,654 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 18:23:13,654 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:13,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-12-03 18:23:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:13,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:13,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:16,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:16,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:16,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:16,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:16,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:16,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:16,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:23:16,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:23:16,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 18:23:16,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:16,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:16,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:24,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:24,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 18:23:24,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:24,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 18:23:24,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 18:23:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 18:23:24,683 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 18:23:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:24,841 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 18:23:24,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 18:23:24,841 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 18:23:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:24,842 INFO L225 Difference]: With dead ends: 96 [2018-12-03 18:23:24,842 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 18:23:24,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 18:23:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 18:23:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 18:23:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 18:23:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 18:23:24,845 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 18:23:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:24,845 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 18:23:24,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 18:23:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 18:23:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 18:23:24,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:24,845 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 18:23:24,846 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:24,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-12-03 18:23:24,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:24,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:24,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:27,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:27,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:27,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:27,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:27,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:27,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:27,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:23:27,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:23:27,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:23:27,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:27,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:27,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 18:23:35,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:35,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 18:23:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 18:23:35,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:23:35,959 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 18:23:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:36,177 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 18:23:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 18:23:36,178 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 18:23:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:36,179 INFO L225 Difference]: With dead ends: 97 [2018-12-03 18:23:36,179 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 18:23:36,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:23:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 18:23:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 18:23:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 18:23:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 18:23:36,183 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 18:23:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:36,184 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 18:23:36,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 18:23:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 18:23:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 18:23:36,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:36,185 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 18:23:36,185 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:36,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-12-03 18:23:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:36,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:36,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:39,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:39,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:39,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:39,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:39,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:39,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:39,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:39,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:23:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:39,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:39,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:47,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:47,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 18:23:47,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:47,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 18:23:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 18:23:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 18:23:47,618 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 18:23:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:47,770 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 18:23:47,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:23:47,771 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 18:23:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:47,772 INFO L225 Difference]: With dead ends: 98 [2018-12-03 18:23:47,772 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 18:23:47,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 18:23:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 18:23:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 18:23:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 18:23:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 18:23:47,776 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 18:23:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:47,776 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 18:23:47,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 18:23:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 18:23:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:23:47,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:47,777 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 18:23:47,777 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:47,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-12-03 18:23:47,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:47,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:23:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:47,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:23:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:50,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:50,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:23:50,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:23:50,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:23:50,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:23:50,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:23:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:23:50,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:23:50,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 18:23:50,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:23:50,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:23:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:50,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:23:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:23:59,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:23:59,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 18:23:59,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:23:59,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 18:23:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 18:23:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 18:23:59,587 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 18:23:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:23:59,722 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 18:23:59,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 18:23:59,722 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 18:23:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:23:59,723 INFO L225 Difference]: With dead ends: 99 [2018-12-03 18:23:59,723 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 18:23:59,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 18:23:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 18:23:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 18:23:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 18:23:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 18:23:59,726 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 18:23:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:23:59,726 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 18:23:59,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 18:23:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 18:23:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 18:23:59,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:23:59,726 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 18:23:59,727 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:23:59,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:23:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-12-03 18:23:59,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:23:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:59,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:23:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:23:59,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:23:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:02,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:02,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:02,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:02,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:02,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:02,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:02,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:24:02,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:24:02,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:24:02,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:02,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:02,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:11,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:11,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 18:24:11,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:11,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 18:24:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 18:24:11,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 18:24:11,667 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 18:24:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:11,842 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 18:24:11,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 18:24:11,842 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 18:24:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:11,843 INFO L225 Difference]: With dead ends: 100 [2018-12-03 18:24:11,843 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 18:24:11,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 18:24:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 18:24:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 18:24:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 18:24:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 18:24:11,847 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 18:24:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:11,847 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 18:24:11,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 18:24:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 18:24:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 18:24:11,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:11,848 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 18:24:11,848 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:11,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-12-03 18:24:11,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:11,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:11,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:11,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:11,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:14,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:14,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:14,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:14,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:14,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:14,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:14,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:14,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:24:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:14,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:15,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:23,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:23,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 18:24:23,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:23,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 18:24:23,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 18:24:23,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 18:24:23,954 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 18:24:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:24,128 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 18:24:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 18:24:24,128 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 18:24:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:24,129 INFO L225 Difference]: With dead ends: 101 [2018-12-03 18:24:24,129 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 18:24:24,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 18:24:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 18:24:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 18:24:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 18:24:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 18:24:24,132 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 18:24:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:24,133 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 18:24:24,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 18:24:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 18:24:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 18:24:24,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:24,133 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 18:24:24,133 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:24,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-12-03 18:24:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:24,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:24,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:27,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:27,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:27,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:27,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:27,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:27,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:27,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:24:27,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:24:27,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 18:24:27,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:27,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:27,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 18:24:36,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:36,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 18:24:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 18:24:36,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 18:24:36,536 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 18:24:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:36,758 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 18:24:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 18:24:36,758 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 18:24:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:36,758 INFO L225 Difference]: With dead ends: 102 [2018-12-03 18:24:36,759 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 18:24:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 18:24:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 18:24:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 18:24:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:24:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 18:24:36,762 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 18:24:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:36,763 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 18:24:36,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 18:24:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 18:24:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:24:36,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:36,763 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 18:24:36,763 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:36,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-12-03 18:24:36,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:36,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:36,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:39,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:39,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:39,964 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:39,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:39,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:39,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:39,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:24:39,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:24:40,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:24:40,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:24:40,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:40,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:24:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:49,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:24:49,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 18:24:49,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:24:49,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 18:24:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 18:24:49,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 18:24:49,425 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 18:24:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:24:49,576 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 18:24:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 18:24:49,576 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 18:24:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:24:49,577 INFO L225 Difference]: With dead ends: 103 [2018-12-03 18:24:49,577 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 18:24:49,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 18:24:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 18:24:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 18:24:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 18:24:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 18:24:49,582 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 18:24:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:24:49,582 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 18:24:49,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 18:24:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 18:24:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 18:24:49,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:24:49,583 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 18:24:49,583 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:24:49,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:24:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-12-03 18:24:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:24:49,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:49,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:24:49,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:24:49,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:24:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:52,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:52,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:24:52,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:24:52,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:24:52,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:24:52,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:24:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:24:52,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:24:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:24:52,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:24:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:24:52,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:02,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:02,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 18:25:02,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:02,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 18:25:02,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 18:25:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 18:25:02,462 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 18:25:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:02,686 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 18:25:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 18:25:02,687 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 18:25:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:02,688 INFO L225 Difference]: With dead ends: 104 [2018-12-03 18:25:02,688 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 18:25:02,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 18:25:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 18:25:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 18:25:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 18:25:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 18:25:02,693 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 18:25:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:02,693 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 18:25:02,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 18:25:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 18:25:02,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 18:25:02,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:02,694 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 18:25:02,694 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:02,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:02,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-12-03 18:25:02,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:02,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:02,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:02,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:06,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:06,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:06,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:06,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:06,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:06,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:06,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:25:06,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:25:06,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 18:25:06,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:06,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:06,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:15,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:15,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 18:25:15,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 18:25:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 18:25:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 18:25:15,960 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 18:25:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:16,246 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 18:25:16,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 18:25:16,246 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 18:25:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:16,247 INFO L225 Difference]: With dead ends: 105 [2018-12-03 18:25:16,247 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 18:25:16,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 18:25:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 18:25:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 18:25:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 18:25:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 18:25:16,251 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 18:25:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:16,251 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 18:25:16,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 18:25:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 18:25:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 18:25:16,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:16,251 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 18:25:16,252 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:16,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-12-03 18:25:16,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:16,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:16,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:19,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:19,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:19,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:19,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:19,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:19,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:19,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:25:19,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:25:19,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:25:19,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:19,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:19,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:29,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:29,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 18:25:29,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:29,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 18:25:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 18:25:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 18:25:29,689 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 18:25:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:29,848 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 18:25:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 18:25:29,848 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 18:25:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:29,849 INFO L225 Difference]: With dead ends: 106 [2018-12-03 18:25:29,849 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 18:25:29,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 18:25:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 18:25:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 18:25:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 18:25:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 18:25:29,854 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 18:25:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:29,854 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 18:25:29,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 18:25:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 18:25:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 18:25:29,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:29,855 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 18:25:29,855 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:29,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-12-03 18:25:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:29,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:29,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:29,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:29,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:33,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:33,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:33,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:33,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:33,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:33,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:33,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:33,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:25:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:33,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:33,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:43,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 18:25:43,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 18:25:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 18:25:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 18:25:43,519 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 18:25:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:43,822 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 18:25:43,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 18:25:43,823 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 18:25:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:43,824 INFO L225 Difference]: With dead ends: 107 [2018-12-03 18:25:43,824 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 18:25:43,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 18:25:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 18:25:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 18:25:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 18:25:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 18:25:43,829 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 18:25:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:43,829 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 18:25:43,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 18:25:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 18:25:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 18:25:43,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:43,830 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 18:25:43,830 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:43,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-12-03 18:25:43,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:43,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:43,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:47,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:47,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:47,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:47,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:47,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:47,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:25:47,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:25:47,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 18:25:47,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:47,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:47,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:57,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:57,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 18:25:57,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:57,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 18:25:57,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 18:25:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 18:25:57,825 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 18:25:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:58,066 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 18:25:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 18:25:58,067 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 18:25:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:58,068 INFO L225 Difference]: With dead ends: 108 [2018-12-03 18:25:58,069 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 18:25:58,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 18:25:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 18:25:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 18:25:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 18:25:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 18:25:58,073 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 18:25:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:58,073 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 18:25:58,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 18:25:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 18:25:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 18:25:58,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:58,074 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 18:25:58,074 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:58,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-12-03 18:25:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:58,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:58,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:58,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:01,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:01,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:01,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:01,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:01,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:01,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:26:01,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:26:01,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:26:01,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:26:01,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:26:01,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:01,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:12,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:12,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 18:26:12,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:12,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 18:26:12,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 18:26:12,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 18:26:12,323 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 18:26:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:12,564 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 18:26:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 18:26:12,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 18:26:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:12,565 INFO L225 Difference]: With dead ends: 109 [2018-12-03 18:26:12,566 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 18:26:12,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 18:26:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 18:26:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 18:26:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 18:26:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 18:26:12,570 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 18:26:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:12,570 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 18:26:12,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 18:26:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 18:26:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 18:26:12,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:12,571 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 18:26:12,571 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:12,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-12-03 18:26:12,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:12,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:12,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:26:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:12,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:16,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:16,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:16,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:16,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:16,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:16,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:26:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:26:16,295 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:26:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:16,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:16,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:27,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:27,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 18:26:27,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:27,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 18:26:27,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 18:26:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 18:26:27,186 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 18:26:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:27,523 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 18:26:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 18:26:27,529 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 18:26:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:27,529 INFO L225 Difference]: With dead ends: 110 [2018-12-03 18:26:27,530 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 18:26:27,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 18:26:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 18:26:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 18:26:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 18:26:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 18:26:27,533 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 18:26:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:27,534 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 18:26:27,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 18:26:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 18:26:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:26:27,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:27,535 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 18:26:27,535 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:27,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-12-03 18:26:27,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:26:27,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:27,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:31,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:31,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:31,266 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:31,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:31,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:31,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:26:31,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:26:31,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:26:31,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 18:26:31,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:26:31,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:31,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 18:26:42,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 18:26:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 18:26:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 18:26:42,314 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 18:26:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:42,627 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 18:26:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 18:26:42,627 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 18:26:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:42,628 INFO L225 Difference]: With dead ends: 111 [2018-12-03 18:26:42,628 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 18:26:42,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 18:26:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 18:26:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 18:26:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 18:26:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 18:26:42,632 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 18:26:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:42,632 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 18:26:42,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 18:26:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 18:26:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 18:26:42,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:42,633 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 18:26:42,633 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:42,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-12-03 18:26:42,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:42,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:26:42,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:42,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:26:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:46,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:46,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:26:46,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:26:46,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:26:46,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:26:46,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:26:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:26:46,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:26:46,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:26:46,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:26:46,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:26:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:46,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:26:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:26:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:26:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 18:26:57,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:26:57,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 18:26:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 18:26:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 18:26:57,651 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 18:26:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:26:57,963 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 18:26:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 18:26:57,963 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 18:26:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:26:57,964 INFO L225 Difference]: With dead ends: 112 [2018-12-03 18:26:57,964 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 18:26:57,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 18:26:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 18:26:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 18:26:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 18:26:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 18:26:57,968 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 18:26:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:26:57,969 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 18:26:57,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 18:26:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 18:26:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 18:26:57,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:26:57,969 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 18:26:57,970 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:26:57,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:26:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-12-03 18:26:57,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:26:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:57,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:26:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:26:57,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:26:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:01,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:01,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:01,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:01,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:01,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:01,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:01,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:01,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:27:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:01,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:01,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:13,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:13,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 18:27:13,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:13,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 18:27:13,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 18:27:13,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 18:27:13,265 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 18:27:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:13,588 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 18:27:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 18:27:13,588 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 18:27:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:13,589 INFO L225 Difference]: With dead ends: 113 [2018-12-03 18:27:13,589 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 18:27:13,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 18:27:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 18:27:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 18:27:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 18:27:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 18:27:13,594 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 18:27:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:13,594 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 18:27:13,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 18:27:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 18:27:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 18:27:13,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:13,595 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 18:27:13,595 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:13,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-12-03 18:27:13,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:13,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:13,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:17,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:17,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:17,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:17,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:17,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:17,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:17,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:27:17,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:27:17,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 18:27:17,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:17,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:17,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:29,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:29,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 18:27:29,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 18:27:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 18:27:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 18:27:29,171 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 18:27:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:29,416 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 18:27:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 18:27:29,417 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 18:27:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:29,418 INFO L225 Difference]: With dead ends: 114 [2018-12-03 18:27:29,418 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 18:27:29,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 18:27:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 18:27:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 18:27:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 18:27:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 18:27:29,422 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 18:27:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:29,422 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 18:27:29,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 18:27:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 18:27:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:27:29,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:29,422 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 18:27:29,423 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:29,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-12-03 18:27:29,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:29,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:29,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:29,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:29,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:33,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:33,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:33,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:33,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:33,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:33,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:27:33,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:27:33,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:27:33,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:33,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:33,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:45,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:45,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 18:27:45,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:45,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 18:27:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 18:27:45,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 18:27:45,230 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 18:27:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:45,514 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 18:27:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 18:27:45,515 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 18:27:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:45,515 INFO L225 Difference]: With dead ends: 115 [2018-12-03 18:27:45,515 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 18:27:45,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 18:27:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 18:27:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 18:27:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 18:27:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 18:27:45,519 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 18:27:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:45,519 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 18:27:45,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 18:27:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 18:27:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 18:27:45,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:45,520 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 18:27:45,520 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:45,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:45,520 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-12-03 18:27:45,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:45,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:45,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:45,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:45,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:49,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:49,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:49,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:49,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:49,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:49,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:49,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:49,600 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:27:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:49,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:49,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:01,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 18:28:01,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:01,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 18:28:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 18:28:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 18:28:01,680 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 18:28:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:02,044 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 18:28:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 18:28:02,045 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 18:28:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:02,046 INFO L225 Difference]: With dead ends: 116 [2018-12-03 18:28:02,046 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 18:28:02,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 18:28:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 18:28:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 18:28:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 18:28:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 18:28:02,050 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 18:28:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 18:28:02,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 18:28:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 18:28:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 18:28:02,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:02,052 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 18:28:02,052 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:02,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-12-03 18:28:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:02,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:02,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:06,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:06,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:06,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:06,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:06,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:28:06,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:28:06,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:28:06,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 18:28:06,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:28:06,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:06,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:18,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:18,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 18:28:18,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:18,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 18:28:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 18:28:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 18:28:18,516 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 18:28:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:18,727 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 18:28:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 18:28:18,728 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 18:28:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:18,728 INFO L225 Difference]: With dead ends: 117 [2018-12-03 18:28:18,728 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 18:28:18,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 18:28:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 18:28:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 18:28:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 18:28:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 18:28:18,734 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 18:28:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:18,734 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 18:28:18,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 18:28:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 18:28:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 18:28:18,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:18,735 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 18:28:18,735 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:18,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-12-03 18:28:18,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:18,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:28:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:18,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:22,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:22,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:22,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:22,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:22,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:22,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:28:22,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:28:22,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:28:23,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:28:23,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:28:23,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:23,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:35,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:35,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 18:28:35,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 18:28:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 18:28:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 18:28:35,425 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-03 18:28:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:35,796 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 18:28:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 18:28:35,796 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-03 18:28:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:35,797 INFO L225 Difference]: With dead ends: 118 [2018-12-03 18:28:35,797 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 18:28:35,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 18:28:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 18:28:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 18:28:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 18:28:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 18:28:35,801 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-03 18:28:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:35,802 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 18:28:35,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 18:28:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 18:28:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 18:28:35,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:35,803 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-03 18:28:35,803 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:35,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-12-03 18:28:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:35,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:35,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:28:35,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:35,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:40,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:40,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:40,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:40,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:40,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:40,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:28:40,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:40,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:28:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:40,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:40,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:28:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:52,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:28:52,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 227 [2018-12-03 18:28:52,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:28:52,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-03 18:28:52,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-03 18:28:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-03 18:28:52,809 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-12-03 18:28:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:28:53,129 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 18:28:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 18:28:53,129 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-12-03 18:28:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:28:53,130 INFO L225 Difference]: With dead ends: 119 [2018-12-03 18:28:53,130 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 18:28:53,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-03 18:28:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 18:28:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 18:28:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 18:28:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-12-03 18:28:53,134 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-12-03 18:28:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:28:53,134 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-12-03 18:28:53,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-03 18:28:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-12-03 18:28:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 18:28:53,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:28:53,135 INFO L402 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-12-03 18:28:53,135 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:28:53,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:28:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-12-03 18:28:53,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:28:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:53,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:28:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:28:53,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:28:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:28:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:57,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:57,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:28:57,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:28:57,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:28:57,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:28:57,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:28:57,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:28:57,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:28:57,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 18:28:57,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:28:57,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:28:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:28:57,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:29:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:29:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 229 [2018-12-03 18:29:10,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:29:10,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 18:29:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 18:29:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 18:29:10,495 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-12-03 18:29:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:29:10,714 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-03 18:29:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 18:29:10,714 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-12-03 18:29:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:29:10,715 INFO L225 Difference]: With dead ends: 120 [2018-12-03 18:29:10,715 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 18:29:10,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 18:29:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 18:29:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 18:29:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 18:29:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 18:29:10,718 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-12-03 18:29:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:29:10,719 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 18:29:10,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 18:29:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 18:29:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 18:29:10,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:29:10,719 INFO L402 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-12-03 18:29:10,720 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:29:10,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:29:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-12-03 18:29:10,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:29:10,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:10,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:29:10,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:10,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:29:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:29:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:15,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:15,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:29:15,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:29:15,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:29:15,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:15,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:29:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:29:15,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:29:15,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:29:15,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:29:15,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:29:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:15,216 INFO L316 TraceCheckSpWp]: Computing backward predicates...