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/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:14:39,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:14:39,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:14:39,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:14:39,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:14:39,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:14:39,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:14:39,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:14:39,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:14:39,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:14:39,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:14:39,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:14:39,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:14:39,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:14:39,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:14:39,041 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:14:39,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:14:39,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:14:39,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:14:39,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:14:39,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:14:39,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:14:39,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:14:39,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:14:39,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:14:39,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:14:39,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:14:39,062 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:14:39,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:14:39,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:14:39,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:14:39,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:14:39,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:14:39,067 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:14:39,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:14:39,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:14:39,071 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 17:14:39,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:14:39,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:14:39,095 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:14:39,095 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:14:39,096 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:14:39,096 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:14:39,096 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:14:39,096 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:14:39,096 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:14:39,097 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:14:39,097 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:14:39,097 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:14:39,097 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:14:39,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:14:39,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:14:39,098 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:14:39,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:14:39,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:14:39,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:14:39,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:14:39,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:14:39,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:14:39,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:14:39,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:14:39,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:14:39,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:14:39,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:14:39,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:14:39,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:14:39,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:14:39,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:14:39,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:14:39,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:14:39,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:14:39,102 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:14:39,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:14:39,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:14:39,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:14:39,103 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:14:39,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:14:39,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:14:39,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:14:39,152 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:14:39,153 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:14:39,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 17:14:39,154 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 17:14:39,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:14:39,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:14:39,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:14:39,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:14:39,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:14:39,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:14:39,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:14:39,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:14:39,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:14:39,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/1) ... [2018-12-03 17:14:39,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:14:39,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:14:39,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:14:39,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:14:39,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (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 17:14:39,312 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:14:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:14:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:14:39,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:14:39,518 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:14:39,521 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:39 BoogieIcfgContainer [2018-12-03 17:14:39,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:14:39,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:14:39,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:14:39,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:14:39,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:39" (1/2) ... [2018-12-03 17:14:39,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56eef5f3 and model type count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:14:39, skipping insertion in model container [2018-12-03 17:14:39,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:39" (2/2) ... [2018-12-03 17:14:39,530 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 17:14:39,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:14:39,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:14:39,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:14:39,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:14:39,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:14:39,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:14:39,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:14:39,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:14:39,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:14:39,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:14:39,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:14:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:14:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:14:39,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:39,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:14:39,649 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:39,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-12-03 17:14:39,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:39,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:39,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:39,867 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 17:14:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:39,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:14:39,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:39,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:14:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:14:39,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:14:39,897 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:14:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:39,971 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:14:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:14:39,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:14:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:39,991 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:14:39,991 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:14:39,998 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 17:14:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:14:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:14:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:14:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:14:40,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:14:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:40,047 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:14:40,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:14:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:14:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:14:40,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:40,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:14:40,048 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:40,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-12-03 17:14:40,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:40,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:40,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:40,184 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 17:14:40,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:40,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:40,185 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:14:40,196 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:14:40,308 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:40,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:40,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:40,522 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:40,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:40,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:40,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:40,541 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 17:14:40,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:40,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:40,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:40,584 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 17:14:40,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:40,648 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 17:14:40,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:40,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:14:40,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:40,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:14:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:14:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:40,671 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 17:14:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:40,707 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 17:14:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:14:40,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 17:14:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:40,709 INFO L225 Difference]: With dead ends: 8 [2018-12-03 17:14:40,709 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:14:40,710 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 17:14:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:14:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:14:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:14:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:14:40,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:14:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:40,713 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:14:40,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:14:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:14:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:14:40,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:40,714 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:14:40,715 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:40,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-12-03 17:14:40,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:40,800 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 17:14:40,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:40,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:40,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:40,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:40,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:40,801 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 17:14:40,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:40,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:40,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:14:40,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:40,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:40,850 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 17:14:40,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:40,931 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 17:14:40,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:40,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:14:40,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:40,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:40,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:40,952 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 17:14:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:40,976 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:14:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:14:40,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:14:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:40,977 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:14:40,977 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:14:40,978 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 17:14:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:14:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:14:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:14:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:14:40,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:14:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:40,981 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:14:40,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:14:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:14:40,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:40,982 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:14:40,983 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:40,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-12-03 17:14:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:40,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,141 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 17:14:41,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:41,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:41,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,142 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 17:14:41,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:41,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:41,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:41,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:41,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:41,217 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 17:14:41,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:41,425 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 17:14:41,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:41,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:14:41,445 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:14:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:14:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:14:41,447 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 17:14:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:41,517 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:14:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:14:41,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 17:14:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:41,518 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:14:41,518 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:14:41,519 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 17:14:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:14:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:14:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:14:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:14:41,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 17:14:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:41,522 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:14:41,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:14:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:14:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:14:41,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:41,524 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 17:14:41,524 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:41,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-12-03 17:14:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,681 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 17:14:41,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:41,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:41,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:41,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,682 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 17:14:41,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:41,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:41,725 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 17:14:41,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:41,857 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 17:14:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:41,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:14:41,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:41,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:41,880 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 17:14:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:41,901 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 17:14:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:14:41,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 17:14:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:41,902 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:14:41,902 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:14:41,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:14:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:14:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:14:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:14:41,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 17:14:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:41,906 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:14:41,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:14:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:41,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:41,907 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:14:41,907 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:41,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-12-03 17:14:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:41,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:41,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,988 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 17:14:41,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:41,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:41,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:41,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,989 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 17:14:41,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:41,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:42,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:14:42,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:42,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:42,034 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 17:14:42,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:42,508 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 17:14:42,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:42,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 17:14:42,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:42,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:42,530 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 17:14:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:42,570 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:14:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:14:42,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:14:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:42,572 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:14:42,572 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:14:42,572 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 17:14:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:14:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:14:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:14:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:14:42,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 17:14:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:42,575 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:14:42,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:14:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:14:42,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:42,576 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 17:14:42,577 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:42,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-12-03 17:14:42,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:42,709 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 17:14:42,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:42,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:42,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:42,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 17:14:42,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:42,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 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 17:14:42,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:42,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:42,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:42,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:42,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:42,735 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 17:14:42,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:42,854 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 17:14:42,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:42,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:14:42,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:42,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:42,876 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 17:14:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:42,900 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 17:14:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:14:42,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:14:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:42,902 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:14:42,902 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:14:42,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:14:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:14:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:14:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:14:42,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 17:14:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:42,906 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:14:42,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:14:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:14:42,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:42,907 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:14:42,907 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:42,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-12-03 17:14:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:43,061 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 17:14:43,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:43,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:43,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:43,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:43,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:43,062 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 17:14:43,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:43,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:43,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:43,094 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 17:14:43,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:43,479 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 17:14:43,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:14:43,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:43,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:43,502 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 17:14:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:43,552 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:14:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:43,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 17:14:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:43,555 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:14:43,555 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 17:14:43,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 17:14:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 17:14:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:14:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:14:43,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 17:14:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:43,559 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:14:43,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:14:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:43,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:43,560 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:14:43,560 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:43,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-12-03 17:14:43,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:43,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:43,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:43,691 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 17:14:43,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:43,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:43,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:43,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:43,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:43,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 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 17:14:43,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:43,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:43,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:14:43,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:43,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:43,719 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 17:14:43,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:43,961 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 17:14:43,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:43,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:14:43,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:43,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:14:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:14:43,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:14:43,982 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 17:14:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:44,005 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 17:14:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:14:44,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:14:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:44,006 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:14:44,006 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:14:44,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 17:14:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:14:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:14:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:14:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:14:44,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 17:14:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:44,010 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:14:44,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:14:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:14:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:44,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:44,010 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:14:44,010 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:44,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-12-03 17:14:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,134 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 17:14:44,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:44,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:44,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:44,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,135 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 17:14:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:44,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:44,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:44,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:44,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:44,176 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 17:14:44,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:44,574 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 17:14:44,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:44,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:14:44,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:44,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:14:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:14:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:44,597 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 17:14:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:44,620 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:14:44,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:44,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:14:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:44,623 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:14:44,623 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:14:44,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:14:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:14:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:14:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:14:44,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 17:14:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:44,627 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:14:44,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:14:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:14:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:44,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:44,628 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 17:14:44,629 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:44,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-12-03 17:14:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,764 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 17:14:44,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:44,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:44,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:44,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,766 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 17:14:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:44,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:44,810 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 17:14:44,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:45,154 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 17:14:45,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:45,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:14:45,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:45,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:14:45,175 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 17:14:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:45,203 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 17:14:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:45,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 17:14:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:45,204 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:14:45,204 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:14:45,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:14:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:14:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:14:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:14:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:14:45,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 17:14:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:45,209 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:14:45,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:14:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:14:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:14:45,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:45,210 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:14:45,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:45,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-12-03 17:14:45,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:45,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:45,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:45,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:45,445 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 17:14:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:45,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:45,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:45,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:45,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:45,446 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 17:14:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:45,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:45,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:14:45,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:45,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:45,499 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 17:14:45,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:45,990 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 17:14:46,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:46,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:14:46,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:46,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:14:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:14:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:14:46,012 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 17:14:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:46,047 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:14:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:46,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 17:14:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:46,048 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:14:46,048 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:14:46,049 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 17:14:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:14:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:14:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:14:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:14:46,052 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 17:14:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:46,052 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:14:46,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:14:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:14:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:14:46,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:46,053 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 17:14:46,053 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:46,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-12-03 17:14:46,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:46,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:46,193 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 17:14:46,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:46,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:46,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:46,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,194 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 17:14:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:46,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:46,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:46,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:46,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:46,222 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 17:14:46,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:46,490 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 17:14:46,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:46,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:14:46,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:46,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:14:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:14:46,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:14:46,512 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 17:14:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:46,540 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 17:14:46,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:14:46,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:14:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:46,548 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:14:46,548 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:14:46,548 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 17:14:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:14:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:14:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:14:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:14:46,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 17:14:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:46,556 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:14:46,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:14:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:14:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:46,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:46,557 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:14:46,558 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:46,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-12-03 17:14:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:46,890 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 17:14:46,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:46,891 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:46,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:46,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,891 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 17:14:46,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:46,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:46,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:46,926 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 17:14:46,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:47,305 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 17:14:47,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:47,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:14:47,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:47,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:14:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:14:47,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:14:47,326 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 17:14:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:47,355 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:14:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:47,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 17:14:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:47,359 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:14:47,359 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:14:47,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:14:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:14:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:14:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:14:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:14:47,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 17:14:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:14:47,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:14:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:14:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:14:47,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:47,364 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 17:14:47,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:47,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-12-03 17:14:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:47,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:47,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:47,540 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 17:14:47,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:47,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:47,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:47,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:47,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:47,541 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 17:14:47,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:47,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:47,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:14:47,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:47,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:47,580 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 17:14:47,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:48,069 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 17:14:48,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:48,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:14:48,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:48,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:14:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:14:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:14:48,090 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 17:14:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:48,295 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 17:14:48,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:48,296 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 17:14:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:48,297 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:14:48,297 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:14:48,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:14:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:14:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:14:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:14:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:14:48,302 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 17:14:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:48,302 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:14:48,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:14:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:14:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:14:48,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:48,303 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:14:48,303 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:48,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-12-03 17:14:48,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:48,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:48,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:48,666 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 17:14:48,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:48,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:48,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:48,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:48,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:48,667 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 17:14:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:48,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:48,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:48,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:48,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:48,695 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 17:14:48,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:49,245 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 17:14:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:14:49,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:14:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:14:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:14:49,266 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 17:14:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:49,300 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:14:49,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:14:49,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:14:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:49,301 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:14:49,302 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:14:49,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:14:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:14:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:14:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:14:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:14:49,306 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 17:14:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:49,307 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:14:49,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:14:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:14:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:14:49,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:49,308 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 17:14:49,308 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:49,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-12-03 17:14:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:49,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:49,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:50,001 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 17:14:50,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:50,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:50,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:50,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:50,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:50,003 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 17:14:50,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:50,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:50,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:50,043 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 17:14:50,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:50,787 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 17:14:50,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:50,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:14:50,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:50,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:14:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:14:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:14:50,807 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 17:14:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:50,831 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 17:14:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:14:50,832 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 17:14:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:50,832 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:14:50,832 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:14:50,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:14:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:14:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:14:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:14:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:14:50,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 17:14:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:50,836 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:14:50,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:14:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:14:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:14:50,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:50,837 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:14:50,837 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:50,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-12-03 17:14:50,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:50,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:51,036 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 17:14:51,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:51,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:51,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:51,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:51,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:51,037 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 17:14:51,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:51,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:51,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:14:51,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:51,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:51,120 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 17:14:51,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:51,973 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 17:14:51,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:14:51,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:51,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:14:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:14:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:14:51,995 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 17:14:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:52,022 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:14:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:14:52,023 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 17:14:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:52,024 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:14:52,024 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:14:52,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:14:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:14:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:14:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:14:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:14:52,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 17:14:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:52,032 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:14:52,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:14:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:14:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:14:52,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:52,033 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 17:14:52,033 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:52,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-12-03 17:14:52,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:52,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:52,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:52,742 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 17:14:52,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:52,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:52,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:52,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:52,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:52,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:14:52,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:52,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:52,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:52,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:52,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:52,773 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 17:14:52,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:53,173 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 17:14:53,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:53,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:14:53,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:53,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:14:53,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:14:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:14:53,194 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 17:14:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:53,230 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 17:14:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:53,230 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 17:14:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:53,231 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:14:53,231 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:14:53,232 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 17:14:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:14:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:14:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:14:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:14:53,236 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 17:14:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:53,236 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:14:53,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:14:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:14:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:14:53,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:53,237 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:14:53,237 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:53,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-12-03 17:14:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:53,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:53,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:53,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:53,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:53,820 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 17:14:53,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:53,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:53,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:53,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:53,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:53,821 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 17:14:53,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:53,831 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:53,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:53,850 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 17:14:53,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:54,343 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 17:14:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:54,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:14:54,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:14:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:14:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:14:54,363 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 17:14:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:54,407 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:14:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:14:54,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 17:14:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:54,409 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:14:54,409 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:14:54,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:14:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:14:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:14:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:14:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:14:54,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 17:14:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:54,412 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:14:54,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:14:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:14:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:14:54,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:54,413 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 17:14:54,414 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:54,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-12-03 17:14:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:54,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:54,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:54,684 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 17:14:54,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:54,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:54,685 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:54,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:54,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:54,685 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 17:14:54,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:54,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:54,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:14:54,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:54,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:54,717 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 17:14:54,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:55,414 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 17:14:55,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:55,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:14:55,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:55,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:14:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:14:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:14:55,435 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 17:14:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:55,476 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 17:14:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:55,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 17:14:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:55,478 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:14:55,478 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:14:55,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:14:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:14:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:14:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:14:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:14:55,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 17:14:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:55,483 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:14:55,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:14:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:14:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:14:55,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:55,484 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:14:55,484 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:55,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-12-03 17:14:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:55,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:55,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:55,880 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 17:14:55,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:55,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:55,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:55,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:55,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:55,882 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 17:14:55,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:55,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:55,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:55,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:55,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:55,913 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 17:14:55,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:56,570 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 17:14:56,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:56,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:14:56,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:56,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:14:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:14:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:14:56,592 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 17:14:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:56,680 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:14:56,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:56,683 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 17:14:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:56,683 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:14:56,683 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:14:56,684 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 17:14:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:14:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:14:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:14:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:14:56,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 17:14:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:56,687 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:14:56,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:14:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:14:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:14:56,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:56,688 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 17:14:56,688 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:56,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-12-03 17:14:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:56,984 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 17:14:56,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:56,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:56,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:56,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:56,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:56,985 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 17:14:56,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:57,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:57,012 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 17:14:57,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:57,629 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 17:14:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:14:57,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:57,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:14:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:14:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:14:57,651 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 17:14:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:57,721 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 17:14:57,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:14:57,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 17:14:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:57,723 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:14:57,723 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:14:57,724 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 17:14:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:14:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:14:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:14:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:14:57,727 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 17:14:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:57,728 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:14:57,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:14:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:14:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:14:57,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:57,728 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:14:57,729 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:57,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-12-03 17:14:57,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:57,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:57,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:58,228 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 17:14:58,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:58,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:58,229 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:58,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:58,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:58,229 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 17:14:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:58,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:58,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:14:58,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:58,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:58,261 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 17:14:58,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:59,303 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 17:14:59,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:59,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:14:59,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:59,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:14:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:14:59,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:14:59,324 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 17:14:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:59,368 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:14:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:14:59,369 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 17:14:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:59,370 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:14:59,370 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:14:59,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:14:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:14:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:14:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:14:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:14:59,376 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 17:14:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:59,376 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:14:59,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:14:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:14:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:14:59,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:59,377 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 17:14:59,377 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:59,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-12-03 17:14:59,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:59,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:59,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:59,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:59,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:59,864 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 17:14:59,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:59,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:59,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:59,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:59,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:59,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:14:59,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:59,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:59,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:59,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:59,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:59,899 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 17:14:59,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:00,842 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 17:15:00,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:00,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:15:00,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:00,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:15:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:15:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:15:00,864 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 17:15:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:00,921 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 17:15:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:15:00,922 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 17:15:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:00,922 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:15:00,923 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:15:00,924 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 17:15:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:15:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:15:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:15:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:15:00,928 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 17:15:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:00,928 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:15:00,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:15:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:15:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:15:00,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:00,933 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:15:00,934 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:00,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-12-03 17:15:00,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:00,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:00,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:00,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:01,386 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 17:15:01,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:01,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:01,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:01,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:01,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:01,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 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 17:15:01,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:01,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:01,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:01,425 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 17:15:01,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:03,217 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 17:15:03,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:03,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:15:03,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:03,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:15:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:15:03,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:15:03,239 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 17:15:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:03,330 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:15:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:15:03,331 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 17:15:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:03,331 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:15:03,332 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:15:03,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:15:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:15:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:15:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:15:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:15:03,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 17:15:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:03,336 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:15:03,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:15:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:15:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:15:03,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:03,336 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 17:15:03,337 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:03,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-12-03 17:15:03,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:03,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:03,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:04,291 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 17:15:04,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:04,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:04,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:04,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:04,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:04,292 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 17:15:04,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:04,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:04,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:15:04,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:04,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:04,324 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 17:15:04,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:05,142 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 17:15:05,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:05,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:15:05,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:05,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:15:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:15:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:15:05,163 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 17:15:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:05,389 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 17:15:05,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:15:05,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 17:15:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:05,390 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:15:05,390 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:15:05,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:15:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:15:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:15:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:15:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:15:05,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 17:15:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:05,395 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:15:05,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:15:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:15:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:15:05,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:05,396 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:15:05,396 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:05,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-12-03 17:15:05,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:05,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:05,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:06,339 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 17:15:06,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:06,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:06,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:06,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 17:15:06,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:06,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 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 17:15:06,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:06,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:06,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:06,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:06,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:06,379 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 17:15:06,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:07,288 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 17:15:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:07,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:15:07,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:07,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:15:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:15:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:15:07,311 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 17:15:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:07,343 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:15:07,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:15:07,343 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 17:15:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:07,344 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:15:07,344 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:15:07,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:15:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:15:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:15:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:15:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:15:07,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 17:15:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:07,349 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:15:07,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:15:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:15:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:15:07,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:07,350 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 17:15:07,350 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:07,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-12-03 17:15:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:07,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:07,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:07,977 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 17:15:07,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:07,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:07,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:07,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:07,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:07,978 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 17:15:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:07,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:08,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:08,010 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 17:15:08,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:09,243 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 17:15:09,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:09,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:15:09,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:15:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:15:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:15:09,263 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 17:15:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:09,349 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 17:15:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:15:09,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 17:15:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:09,350 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:15:09,350 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:15:09,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:15:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:15:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:15:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:15:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:15:09,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 17:15:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:09,354 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:15:09,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:15:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:15:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:15:09,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:09,355 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:15:09,356 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:09,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-12-03 17:15:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:09,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:09,749 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 17:15:09,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:09,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:09,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:09,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:09,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:09,751 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 17:15:09,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:09,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:09,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:15:09,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:09,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:09,785 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 17:15:09,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:10,903 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 17:15:10,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:10,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:15:10,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:10,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:15:10,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:15:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:15:10,923 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 17:15:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:10,990 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 17:15:10,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:15:10,991 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 17:15:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:10,992 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:15:10,992 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:15:10,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:15:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:15:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 17:15:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:15:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 17:15:10,995 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 17:15:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:10,995 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 17:15:10,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:15:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 17:15:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:15:10,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:10,996 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 17:15:10,996 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:10,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-12-03 17:15:10,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:10,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:10,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:10,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:10,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:11,382 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 17:15:11,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:11,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:11,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:11,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:11,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:11,383 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 17:15:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:11,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:11,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:11,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:11,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:11,424 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 17:15:11,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:12,801 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 17:15:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:12,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:15:12,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:12,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:15:12,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:15:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:15:12,821 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 17:15:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:12,876 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 17:15:12,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:15:12,877 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 17:15:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:12,877 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:15:12,877 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:15:12,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:15:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:15:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:15:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:15:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 17:15:12,881 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 17:15:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:12,881 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 17:15:12,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:15:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 17:15:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:15:12,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:12,882 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 17:15:12,882 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:12,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-12-03 17:15:12,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:12,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:12,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:13,485 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 17:15:13,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:13,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:13,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:13,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:13,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:13,486 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 17:15:13,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:13,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:13,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:13,517 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 17:15:13,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:14,864 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 17:15:14,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:14,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:15:14,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:14,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:15:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:15:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:15:14,883 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 17:15:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:14,948 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 17:15:14,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:15:14,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 17:15:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:14,949 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:15:14,949 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:15:14,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:15:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:15:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 17:15:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:15:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 17:15:14,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 17:15:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:14,955 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 17:15:14,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:15:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 17:15:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:15:14,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:14,956 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 17:15:14,956 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:14,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-12-03 17:15:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:15,418 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 17:15:15,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:15,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:15,419 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:15,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:15,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:15,420 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 17:15:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:15,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:15,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:15:15,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:15,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:15,456 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 17:15:15,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:16,631 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 17:15:16,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:16,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:15:16,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:16,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:15:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:15:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:15:16,651 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 17:15:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:16,724 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 17:15:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:15:16,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 17:15:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:16,725 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:15:16,725 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:15:16,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:15:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:15:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:15:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:15:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:15:16,730 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 17:15:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:16,730 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:15:16,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:15:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:15:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:15:16,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:16,730 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 17:15:16,730 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:16,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-12-03 17:15:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:16,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:16,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:17,338 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 17:15:17,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:17,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:17,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:17,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:17,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:17,339 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 17:15:17,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:17,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:17,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:17,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:17,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:17,373 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 17:15:17,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:18,641 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 17:15:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:15:18,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:18,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:15:18,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:15:18,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:15:18,661 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 17:15:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:18,761 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 17:15:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:15:18,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 17:15:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:18,763 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:15:18,763 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:15:18,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:15:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:15:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 17:15:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:15:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 17:15:18,766 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 17:15:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:18,767 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 17:15:18,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:15:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 17:15:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:15:18,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:18,767 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 17:15:18,768 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:18,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-12-03 17:15:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:19,512 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 17:15:19,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:19,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:19,513 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:19,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:19,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:19,513 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 17:15:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:19,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:19,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:19,546 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 17:15:19,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:20,813 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 17:15:20,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:20,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:15:20,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:20,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:15:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:15:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:15:20,834 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 17:15:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:20,898 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 17:15:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:15:20,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 17:15:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:20,899 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:15:20,899 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:15:20,900 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 17:15:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:15:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:15:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:15:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 17:15:20,903 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 17:15:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:20,903 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 17:15:20,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:15:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 17:15:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:15:20,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:20,904 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 17:15:20,904 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:20,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-12-03 17:15:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:20,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:20,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:21,440 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 17:15:21,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:21,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:21,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:21,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:21,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:21,441 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 17:15:21,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:21,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:21,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:15:21,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:21,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:21,479 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 17:15:21,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:23,129 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 17:15:23,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:23,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:15:23,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:23,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:15:23,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:15:23,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:15:23,149 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 17:15:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:23,196 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 17:15:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:15:23,196 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 17:15:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:23,197 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:15:23,197 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:15:23,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:15:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:15:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:15:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:15:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 17:15:23,201 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 17:15:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:23,201 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 17:15:23,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:15:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 17:15:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:15:23,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:23,202 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 17:15:23,202 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:23,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-12-03 17:15:23,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:23,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:23,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:23,739 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 17:15:23,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:23,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:23,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:23,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:23,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:23,740 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 17:15:23,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:23,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:23,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:23,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:23,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:23,776 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 17:15:23,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:25,736 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 17:15:25,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:25,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:15:25,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:25,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:15:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:15:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:15:25,757 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 17:15:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:25,809 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 17:15:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:15:25,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 17:15:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:25,810 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:15:25,810 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:15:25,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:15:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:15:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:15:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:15:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 17:15:25,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 17:15:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:25,814 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 17:15:25,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:15:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 17:15:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:15:25,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:25,815 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 17:15:25,815 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-12-03 17:15:25,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:25,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:25,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:26,815 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 17:15:26,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:26,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:26,815 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:26,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:26,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:26,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:15:26,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:26,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:26,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:26,848 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 17:15:26,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:28,376 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 17:15:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:15:28,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:28,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:15:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:15:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:15:28,395 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 17:15:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:28,456 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 17:15:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:15:28,456 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 17:15:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:28,457 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:15:28,457 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:15:28,457 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 17:15:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:15:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:15:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:15:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 17:15:28,460 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 17:15:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:28,460 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 17:15:28,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:15:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 17:15:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:15:28,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:28,461 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 17:15:28,461 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:28,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-12-03 17:15:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:28,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:29,112 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 17:15:29,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:29,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:29,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:29,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:29,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:29,113 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 17:15:29,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:29,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:29,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:15:29,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:29,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:29,155 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 17:15:29,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:31,131 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 17:15:31,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:31,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:15:31,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:31,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:15:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:15:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:15:31,153 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 17:15:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:31,214 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 17:15:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:15:31,214 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 17:15:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:31,215 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:15:31,215 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:15:31,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:15:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:15:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:15:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:15:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 17:15:31,219 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 17:15:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:31,219 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 17:15:31,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:15:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 17:15:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:15:31,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:31,220 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 17:15:31,220 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:31,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-12-03 17:15:31,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:31,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:31,827 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 17:15:31,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:31,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:31,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:31,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:31,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:31,828 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 17:15:31,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:31,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:31,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:31,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:31,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:31,862 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 17:15:31,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:33,627 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 17:15:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:15:33,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:15:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:15:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:15:33,646 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 17:15:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:33,713 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 17:15:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:15:33,713 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 17:15:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:33,714 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:15:33,714 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:15:33,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:15:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:15:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:15:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:15:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 17:15:33,717 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 17:15:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:33,717 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 17:15:33,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:15:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 17:15:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:15:33,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:33,718 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 17:15:33,718 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:33,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-12-03 17:15:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:33,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:33,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:34,492 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 17:15:34,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:34,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:34,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:34,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:34,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:34,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 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 17:15:34,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:34,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:34,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:34,535 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 17:15:34,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:36,461 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 17:15:36,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:36,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:15:36,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:36,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:15:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:15:36,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:15:36,482 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 17:15:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:36,614 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 17:15:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:15:36,616 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 17:15:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:36,617 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:15:36,617 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:15:36,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:15:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:15:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:15:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:15:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 17:15:36,619 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 17:15:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:36,619 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 17:15:36,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:15:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 17:15:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:15:36,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:36,620 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 17:15:36,620 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-12-03 17:15:36,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:36,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:36,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:36,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:36,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:37,370 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 17:15:37,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:37,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:37,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:37,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:37,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:37,371 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 17:15:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:37,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:37,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:15:37,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:37,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:37,426 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 17:15:37,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:39,315 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 17:15:39,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:39,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:15:39,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:39,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:15:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:15:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:15:39,335 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 17:15:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:39,403 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 17:15:39,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:15:39,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 17:15:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:39,404 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:15:39,404 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:15:39,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:15:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:15:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:15:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:15:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 17:15:39,407 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 17:15:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:39,408 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 17:15:39,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:15:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 17:15:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:15:39,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:39,408 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 17:15:39,408 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-12-03 17:15:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:39,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:39,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:39,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:40,456 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 17:15:40,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:40,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:40,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:40,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:40,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:40,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:15:40,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:40,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:40,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:40,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:40,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:40,494 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 17:15:40,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:42,560 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 17:15:42,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:42,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:15:42,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:42,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:15:42,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:15:42,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:15:42,580 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 17:15:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:42,629 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 17:15:42,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:15:42,630 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 17:15:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:42,631 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:15:42,631 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:15:42,632 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 17:15:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:15:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:15:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:15:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 17:15:42,634 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 17:15:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:42,635 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 17:15:42,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:15:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 17:15:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:15:42,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:42,635 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 17:15:42,636 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:42,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-12-03 17:15:42,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:42,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:42,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:42,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:42,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:43,364 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 17:15:43,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:43,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:43,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:43,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 17:15:43,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:43,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 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 17:15:43,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:43,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:43,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:43,400 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 17:15:43,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:45,964 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 17:15:45,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:45,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:15:45,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:45,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:15:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:15:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:15:45,984 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 17:15:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:46,058 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 17:15:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:15:46,059 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 17:15:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:46,060 INFO L225 Difference]: With dead ends: 50 [2018-12-03 17:15:46,060 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:15:46,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:15:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:15:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:15:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:15:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 17:15:46,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 17:15:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:46,063 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 17:15:46,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:15:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 17:15:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:15:46,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:46,064 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 17:15:46,065 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:46,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:46,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-12-03 17:15:46,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:46,895 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 17:15:46,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:46,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:46,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:46,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:46,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:46,896 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 17:15:46,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:46,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:46,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:15:46,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:46,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:46,939 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 17:15:46,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:49,027 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 17:15:49,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:15:49,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:49,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:15:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:15:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:15:49,047 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 17:15:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:49,155 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 17:15:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:15:49,155 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 17:15:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:49,156 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:15:49,156 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:15:49,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:15:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:15:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:15:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:15:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 17:15:49,160 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 17:15:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:49,160 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 17:15:49,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:15:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 17:15:49,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:15:49,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:49,161 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 17:15:49,161 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:49,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-12-03 17:15:49,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:49,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:49,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:49,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:49,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:50,267 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 17:15:50,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:50,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:50,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:50,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 17:15:50,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:50,268 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 17:15:50,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:50,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:50,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:50,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:50,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:50,310 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 17:15:50,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:52,524 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 17:15:52,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:52,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:15:52,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:52,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:15:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:15:52,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:15:52,544 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 17:15:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:52,963 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 17:15:52,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:15:52,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 17:15:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:52,964 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:15:52,964 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:15:52,965 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 17:15:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:15:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:15:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:15:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 17:15:52,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 17:15:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:52,967 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 17:15:52,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:15:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 17:15:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:15:52,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:52,969 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 17:15:52,969 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:52,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-12-03 17:15:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:52,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:52,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:53,924 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 17:15:53,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:53,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:53,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:53,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:53,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:53,924 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 17:15:53,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:53,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:53,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:53,963 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 17:15:53,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:56,768 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 17:15:56,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:56,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:15:56,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:56,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:15:56,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:15:56,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:15:56,788 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 17:15:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:56,869 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 17:15:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:15:56,870 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 17:15:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:56,871 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:15:56,871 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:15:56,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:15:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:15:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:15:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:15:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 17:15:56,874 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 17:15:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:56,874 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 17:15:56,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:15:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 17:15:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:15:56,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:56,875 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 17:15:56,875 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:56,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-12-03 17:15:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:56,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:57,799 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 17:15:57,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:57,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:57,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:57,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:57,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:57,800 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 17:15:57,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:57,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:57,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:15:57,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:57,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:57,851 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 17:15:57,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:00,464 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 17:16:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:16:00,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:00,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:16:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:16:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:16:00,486 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 17:16:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:00,544 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 17:16:00,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:16:00,544 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 17:16:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:00,545 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:16:00,545 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:16:00,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:16:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:16:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:16:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:16:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 17:16:00,549 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 17:16:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:00,550 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 17:16:00,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:16:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 17:16:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:16:00,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:00,550 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 17:16:00,551 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:00,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-12-03 17:16:00,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:00,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:00,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:01,920 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 17:16:01,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:01,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:01,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:01,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:01,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:01,921 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 17:16:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:01,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:16:01,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:16:01,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:01,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:01,964 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 17:16:01,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:04,517 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 17:16:04,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:04,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:16:04,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:04,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:16:04,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:16:04,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:16:04,548 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 17:16:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:04,674 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 17:16:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:16:04,674 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 17:16:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:04,675 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:16:04,675 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:16:04,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:16:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:16:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:16:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:16:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 17:16:04,678 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 17:16:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:04,678 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 17:16:04,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:16:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 17:16:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:16:04,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:04,679 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 17:16:04,679 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:04,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-12-03 17:16:04,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:04,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:04,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:04,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:05,915 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 17:16:05,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:05,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:05,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:05,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:05,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:05,916 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 17:16:05,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:05,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:05,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:05,957 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 17:16:05,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:08,805 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 17:16:08,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:08,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:16:08,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:08,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:16:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:16:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:16:08,827 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 17:16:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:08,892 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 17:16:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:16:08,893 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 17:16:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:08,894 INFO L225 Difference]: With dead ends: 56 [2018-12-03 17:16:08,894 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:16:08,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:16:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:16:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:16:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:16:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 17:16:08,897 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 17:16:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:08,897 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 17:16:08,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:16:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 17:16:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:16:08,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:08,897 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 17:16:08,898 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:08,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-12-03 17:16:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:08,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:09,954 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 17:16:09,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:09,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:09,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:09,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 17:16:09,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:09,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 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 17:16:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:09,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:10,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:16:10,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:10,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:10,013 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 17:16:10,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:13,076 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 17:16:13,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:13,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:16:13,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:13,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:16:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:16:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:16:13,107 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 17:16:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:13,248 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 17:16:13,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:16:13,249 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 17:16:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:13,250 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:16:13,250 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:16:13,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:16:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:16:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 17:16:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:16:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 17:16:13,254 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 17:16:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:13,254 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 17:16:13,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:16:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 17:16:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:16:13,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:13,255 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 17:16:13,255 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:13,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-12-03 17:16:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:14,570 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 17:16:14,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:14,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:14,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:14,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:14,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:14,571 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 17:16:14,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:14,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:16:14,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:16:14,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:14,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:14,615 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 17:16:14,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:17,731 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 17:16:17,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:17,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:16:17,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:17,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:16:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:16:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:16:17,752 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 17:16:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:17,836 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 17:16:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:16:17,837 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 17:16:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:17,837 INFO L225 Difference]: With dead ends: 58 [2018-12-03 17:16:17,837 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 17:16:17,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:16:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 17:16:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 17:16:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:16:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 17:16:17,840 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 17:16:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:17,840 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 17:16:17,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:16:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 17:16:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:16:17,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:17,841 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 17:16:17,841 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:17,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-12-03 17:16:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:17,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:17,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:17,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:18,892 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 17:16:18,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:18,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:18,892 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:18,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:18,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:18,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:16:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:18,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:18,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:18,934 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 17:16:18,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:22,190 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 17:16:22,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:22,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:16:22,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:22,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:16:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:16:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:16:22,212 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 17:16:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:22,329 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 17:16:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:16:22,330 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 17:16:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:22,331 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:16:22,331 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:16:22,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:16:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:16:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 17:16:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:16:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 17:16:22,334 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 17:16:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:22,334 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 17:16:22,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:16:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 17:16:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:16:22,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:22,335 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 17:16:22,335 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:22,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-12-03 17:16:22,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:22,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:22,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:23,458 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 17:16:23,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:23,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:23,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:23,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:23,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:23,458 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 17:16:23,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:23,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:23,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:16:23,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:23,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:23,509 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 17:16:23,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:26,685 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 17:16:26,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:26,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:16:26,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:26,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:16:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:16:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:16:26,706 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 17:16:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:26,773 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 17:16:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:16:26,774 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 17:16:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:26,775 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:16:26,775 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:16:26,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:16:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:16:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:16:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:16:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 17:16:26,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 17:16:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:26,779 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 17:16:26,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:16:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 17:16:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:16:26,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:26,779 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 17:16:26,780 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:26,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-12-03 17:16:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:26,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:26,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:28,626 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 17:16:28,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:28,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:28,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:28,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:28,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:28,627 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 17:16:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:28,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:16:28,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:16:28,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:28,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:28,671 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 17:16:28,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:31,998 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 17:16:32,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:32,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:16:32,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:32,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:16:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:16:32,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:16:32,019 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 17:16:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:32,106 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 17:16:32,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:16:32,106 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 17:16:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:32,107 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:16:32,107 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:16:32,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:16:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:16:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:16:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:16:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 17:16:32,111 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 17:16:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:32,111 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 17:16:32,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:16:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 17:16:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:16:32,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:32,112 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 17:16:32,112 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:32,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-12-03 17:16:32,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:32,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:32,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:32,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:32,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:33,273 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 17:16:33,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:33,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:33,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:33,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:33,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:33,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:16:33,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:33,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:33,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:33,316 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 17:16:33,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:36,822 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 17:16:36,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:36,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:16:36,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:36,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:16:36,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:16:36,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:16:36,842 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 17:16:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:36,962 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 17:16:36,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:16:36,963 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 17:16:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:36,964 INFO L225 Difference]: With dead ends: 62 [2018-12-03 17:16:36,964 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:16:36,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:16:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:16:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:16:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:16:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 17:16:36,968 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 17:16:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:36,968 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 17:16:36,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:16:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 17:16:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:16:36,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:36,969 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 17:16:36,969 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:36,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-12-03 17:16:36,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:36,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:36,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:38,316 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 17:16:38,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:38,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:38,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:38,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 17:16:38,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:38,316 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 17:16:38,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:38,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:38,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:16:38,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:38,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:38,380 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 17:16:38,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:41,964 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 17:16:41,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:41,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:16:41,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:41,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:16:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:16:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:16:41,984 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 17:16:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:42,057 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 17:16:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:16:42,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 17:16:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:42,058 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:16:42,059 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:16:42,060 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 17:16:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:16:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:16:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:16:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 17:16:42,063 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 17:16:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:42,063 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 17:16:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:16:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 17:16:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:16:42,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:42,064 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 17:16:42,064 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:42,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-12-03 17:16:42,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:42,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:42,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:43,575 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 17:16:43,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:43,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:43,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:43,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:43,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:43,576 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 17:16:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:43,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:16:43,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:16:43,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:43,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:43,620 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 17:16:43,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:47,231 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 17:16:47,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:47,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:16:47,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:47,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:16:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:16:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:16:47,252 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 17:16:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:47,349 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 17:16:47,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:16:47,349 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 17:16:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:47,350 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:16:47,350 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:16:47,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:16:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:16:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 17:16:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:16:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 17:16:47,354 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 17:16:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:47,354 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 17:16:47,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:16:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 17:16:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:16:47,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:47,355 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 17:16:47,355 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:47,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-12-03 17:16:47,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:47,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:47,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:48,874 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 17:16:48,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:48,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:48,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:48,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:48,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:48,875 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 17:16:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:48,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:48,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:48,934 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 17:16:48,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:52,848 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 17:16:52,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:52,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:16:52,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:52,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:16:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:16:52,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:16:52,867 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 17:16:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:52,952 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 17:16:52,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:16:52,953 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 17:16:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:52,953 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:16:52,954 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:16:52,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:16:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:16:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:16:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:16:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 17:16:52,959 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 17:16:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:52,959 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 17:16:52,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:16:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 17:16:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:16:52,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:52,960 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 17:16:52,960 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:52,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-12-03 17:16:52,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:52,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:52,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:54,294 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 17:16:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:54,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:54,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:54,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:54,295 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 17:16:54,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:54,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:54,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:16:54,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:54,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:54,349 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 17:16:54,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:58,355 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 17:16:58,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:58,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:16:58,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:58,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:16:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:16:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:16:58,375 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 17:16:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:58,448 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 17:16:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:16:58,449 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 17:16:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:58,449 INFO L225 Difference]: With dead ends: 66 [2018-12-03 17:16:58,449 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 17:16:58,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:16:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 17:16:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 17:16:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:16:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 17:16:58,452 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 17:16:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:58,452 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 17:16:58,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:16:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 17:16:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:16:58,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:58,452 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 17:16:58,452 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:58,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-12-03 17:16:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:58,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:58,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:59,979 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 17:16:59,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:59,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:59,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:59,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:59,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:59,980 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 17:16:59,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:59,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:00,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:00,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:00,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:00,028 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 17:17:00,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:04,159 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 17:17:04,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:04,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:17:04,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:04,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:17:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:17:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:17:04,179 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 17:17:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:04,282 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 17:17:04,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:17:04,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 17:17:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:04,283 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:17:04,283 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:17:04,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:17:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:17:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:17:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:17:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 17:17:04,287 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 17:17:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:04,287 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 17:17:04,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:17:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 17:17:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:17:04,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:04,288 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 17:17:04,288 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:04,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-12-03 17:17:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:04,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:04,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:05,669 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 17:17:05,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:05,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:05,669 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:05,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:05,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:05,670 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 17:17:05,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:05,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:05,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:05,718 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 17:17:05,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:09,991 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 17:17:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:17:10,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:10,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:17:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:17:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:17:10,012 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 17:17:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:10,123 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 17:17:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:17:10,124 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 17:17:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:10,124 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:17:10,124 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:17:10,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:17:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:17:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:17:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:17:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 17:17:10,128 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 17:17:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:10,128 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 17:17:10,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:17:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 17:17:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:17:10,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:10,129 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 17:17:10,129 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:10,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-12-03 17:17:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:10,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:11,569 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 17:17:11,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:11,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:11,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:11,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:11,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:11,570 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 17:17:11,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:17:11,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:17:11,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:17:11,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:11,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:11,628 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 17:17:11,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:15,876 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 17:17:15,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:15,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:17:15,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:15,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:17:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:17:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:17:15,896 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 17:17:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:16,013 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 17:17:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:17:16,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 17:17:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:16,014 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:17:16,014 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:17:16,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:17:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:17:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:17:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:17:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 17:17:16,018 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 17:17:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:16,018 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 17:17:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:17:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 17:17:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:17:16,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:16,019 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 17:17:16,019 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:16,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-12-03 17:17:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:16,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:16,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:17,815 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 17:17:17,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:17,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:17,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:17,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:17,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:17,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:17:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:17:17,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:17,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:17,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:17,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:17,865 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 17:17:17,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:22,435 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 17:17:22,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:22,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:17:22,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:22,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:17:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:17:22,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:17:22,457 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 17:17:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:22,566 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 17:17:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:17:22,570 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 17:17:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:22,571 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:17:22,571 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:17:22,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:17:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:17:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:17:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:17:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 17:17:22,575 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 17:17:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:22,575 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 17:17:22,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:17:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 17:17:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:17:22,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:22,576 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 17:17:22,576 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:22,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-12-03 17:17:22,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:22,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:22,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:22,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:24,143 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 17:17:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:24,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:24,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:24,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:24,143 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 17:17:24,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:24,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:24,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:24,195 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 17:17:24,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:28,759 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 17:17:28,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:28,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:17:28,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:28,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:17:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:17:28,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:17:28,779 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 17:17:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:28,879 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 17:17:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:17:28,880 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 17:17:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:28,880 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:17:28,880 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:17:28,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:17:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:17:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:17:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:17:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 17:17:28,883 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 17:17:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:28,884 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 17:17:28,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:17:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 17:17:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:17:28,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:28,884 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 17:17:28,884 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:28,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-12-03 17:17:28,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:28,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:28,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:30,425 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 17:17:30,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:30,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:30,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:30,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:30,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:30,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:17:30,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:17:30,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:17:30,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:17:30,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:30,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:30,487 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 17:17:30,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:35,236 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 17:17:35,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:35,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:17:35,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:35,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:17:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:17:35,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:17:35,257 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 17:17:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:35,351 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 17:17:35,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:17:35,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 17:17:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:35,353 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:17:35,353 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 17:17:35,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:17:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 17:17:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 17:17:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:17:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 17:17:35,357 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 17:17:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:35,357 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 17:17:35,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:17:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 17:17:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:17:35,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:35,357 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 17:17:35,358 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:35,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-12-03 17:17:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:35,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:35,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:35,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:35,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:37,881 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 17:17:37,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:37,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:37,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:37,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:37,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:37,882 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 17:17:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:17:37,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:37,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:37,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:37,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:37,934 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 17:17:37,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:42,797 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 17:17:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:42,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:17:42,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:42,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:17:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:17:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:17:42,817 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 17:17:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:43,094 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 17:17:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:17:43,094 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 17:17:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:43,095 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:17:43,095 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:17:43,096 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 17:17:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:17:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 17:17:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 17:17:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 17:17:43,098 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 17:17:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:43,098 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 17:17:43,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:17:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 17:17:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:17:43,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:43,099 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 17:17:43,099 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:43,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-12-03 17:17:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:43,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:43,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:43,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:43,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:44,721 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 17:17:44,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:44,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:44,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:44,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:44,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:44,722 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 17:17:44,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:44,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:44,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:44,772 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 17:17:44,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:49,814 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 17:17:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:49,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:17:49,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:49,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:17:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:17:49,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:17:49,836 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 17:17:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:49,921 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 17:17:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:17:49,922 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 17:17:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:49,923 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:17:49,923 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 17:17:49,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:17:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 17:17:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 17:17:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:17:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 17:17:49,926 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 17:17:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:49,926 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 17:17:49,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:17:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 17:17:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:17:49,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:49,927 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 17:17:49,927 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:49,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-12-03 17:17:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:49,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:51,673 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 17:17:51,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:51,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:51,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:51,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:51,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:51,674 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 17:17:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:17:51,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:17:51,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:17:51,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:51,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:51,744 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 17:17:51,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:56,891 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 17:17:56,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:56,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:17:56,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:56,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:17:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:17:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:17:56,911 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 17:17:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:57,088 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 17:17:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:17:57,089 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 17:17:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:57,090 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:17:57,090 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:17:57,091 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 17:17:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:17:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 17:17:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:17:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 17:17:57,093 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 17:17:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:57,093 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 17:17:57,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:17:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 17:17:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:17:57,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:57,094 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 17:17:57,094 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:57,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:57,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-12-03 17:17:57,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:57,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:57,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:57,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:57,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:59,152 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 17:17:59,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:59,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:59,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:59,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:59,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:59,153 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 17:17:59,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:17:59,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:59,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:59,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:59,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:59,230 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 17:17:59,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:04,598 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 17:18:04,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:04,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:18:04,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:04,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:18:04,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:18:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:18:04,618 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 17:18:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:04,737 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 17:18:04,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:18:04,737 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 17:18:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:04,738 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:18:04,739 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:18:04,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:18:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:18:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:18:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:18:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 17:18:04,743 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 17:18:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:04,743 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 17:18:04,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:18:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 17:18:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:18:04,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:04,744 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 17:18:04,744 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:04,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-12-03 17:18:04,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:04,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:04,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:07,044 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 17:18:07,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:07,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:07,044 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:07,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:07,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:07,045 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 17:18:07,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:07,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:07,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:07,110 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 17:18:07,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:12,604 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 17:18:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:18:12,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:12,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:18:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:18:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:18:12,626 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 17:18:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:12,778 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 17:18:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:18:12,779 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 17:18:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:12,780 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:18:12,780 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:18:12,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:18:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:18:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:18:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:18:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 17:18:12,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 17:18:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:12,785 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 17:18:12,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:18:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 17:18:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:18:12,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:12,785 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 17:18:12,786 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:12,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-12-03 17:18:12,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:12,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:15,027 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 17:18:15,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:15,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:15,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:15,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:15,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:15,028 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 17:18:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:18:15,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:18:15,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:18:15,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:15,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:15,093 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 17:18:15,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:20,786 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 17:18:20,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:20,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:18:20,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:20,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:18:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:18:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:18:20,806 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 17:18:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:20,953 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 17:18:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:18:20,953 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 17:18:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:20,954 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:18:20,954 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:18:20,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:18:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:18:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:18:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:18:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 17:18:20,958 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 17:18:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:20,959 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 17:18:20,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:18:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 17:18:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:18:20,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:20,960 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 17:18:20,960 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:20,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-12-03 17:18:20,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:20,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:20,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:22,950 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 17:18:22,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:22,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:22,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:22,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 17:18:22,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:22,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 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 17:18:22,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:18:22,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:18:22,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:18:22,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:22,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:23,007 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 17:18:23,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:29,123 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 17:18:29,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:29,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:18:29,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:29,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:18:29,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:18:29,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:18:29,143 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 17:18:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:29,276 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 17:18:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:18:29,277 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 17:18:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:29,278 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:18:29,278 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:18:29,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:18:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:18:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:18:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:18:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 17:18:29,282 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 17:18:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:29,283 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 17:18:29,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:18:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 17:18:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:18:29,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:29,284 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 17:18:29,284 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:29,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-12-03 17:18:29,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:29,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:29,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:29,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:29,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:31,602 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 17:18:31,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:31,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:31,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:31,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:31,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:31,603 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 17:18:31,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:31,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:31,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:31,659 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 17:18:31,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:37,602 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 17:18:37,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:37,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:18:37,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:37,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:18:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:18:37,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:18:37,623 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 17:18:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:37,772 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 17:18:37,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:18:37,772 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 17:18:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:37,773 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:18:37,773 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 17:18:37,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:18:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 17:18:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 17:18:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:18:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 17:18:37,776 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 17:18:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:37,776 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 17:18:37,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:18:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 17:18:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:18:37,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:37,777 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 17:18:37,777 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:37,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-12-03 17:18:37,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:37,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:40,014 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 17:18:40,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:40,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:40,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:40,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 17:18:40,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:40,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 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 17:18:40,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:18:40,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:18:40,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:18:40,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:40,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:40,087 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 17:18:40,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:46,126 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 17:18:46,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:18:46,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:46,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:18:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:18:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:18:46,146 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 17:18:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:46,253 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 17:18:46,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:18:46,254 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 17:18:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:46,254 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:18:46,254 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:18:46,255 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 17:18:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:18:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 17:18:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:18:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 17:18:46,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 17:18:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:46,257 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 17:18:46,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:18:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 17:18:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:18:46,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:46,258 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 17:18:46,259 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:46,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-12-03 17:18:46,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:46,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:46,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:49,465 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 17:18:49,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:49,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:49,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:49,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:49,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:49,466 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 17:18:49,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:18:49,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:18:49,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:18:49,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:49,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:49,522 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 17:18:49,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:55,679 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 17:18:55,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:55,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:18:55,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:55,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:18:55,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:18:55,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:18:55,699 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 17:18:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:55,806 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 17:18:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:18:55,807 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 17:18:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:55,808 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:18:55,808 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:18:55,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:18:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:18:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:18:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:18:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 17:18:55,812 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 17:18:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:55,813 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 17:18:55,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:18:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 17:18:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:18:55,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:55,813 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 17:18:55,813 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:55,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-12-03 17:18:55,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:55,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:55,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:58,048 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 17:18:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:58,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:58,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:58,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:58,049 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 17:18:58,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:58,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:58,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:58,120 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 17:18:58,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:04,469 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 17:19:04,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:04,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:19:04,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:04,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:19:04,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:19:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:19:04,489 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 17:19:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:04,924 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 17:19:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:19:04,925 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 17:19:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:04,925 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:19:04,925 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:19:04,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:19:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:19:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:19:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:19:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 17:19:04,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 17:19:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:04,929 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 17:19:04,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:19:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 17:19:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:19:04,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:04,930 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 17:19:04,930 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:04,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-12-03 17:19:04,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:04,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:04,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:04,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:04,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:07,040 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 17:19:07,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:07,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:07,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:07,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:07,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:07,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:19:07,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:19:07,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:19:07,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:19:07,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:07,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:07,142 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 17:19:07,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:13,621 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 17:19:13,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:13,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:19:13,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:13,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:19:13,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:19:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:19:13,642 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 17:19:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:14,281 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 17:19:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:19:14,281 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 17:19:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:14,282 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:19:14,282 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:19:14,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:19:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:19:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:19:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:19:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 17:19:14,285 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 17:19:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:14,285 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 17:19:14,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:19:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 17:19:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:19:14,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:14,286 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 17:19:14,286 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:14,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-12-03 17:19:14,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:14,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:14,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:18,430 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 17:19:18,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:18,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:18,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:18,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:18,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:18,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:19:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:19:18,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:19:18,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:19:18,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:18,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:18,502 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 17:19:18,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:25,473 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 17:19:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:19:25,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:19:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:19:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:19:25,495 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 17:19:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:25,630 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 17:19:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:19:25,631 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 17:19:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:25,631 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:19:25,632 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:19:25,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:19:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:19:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:19:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:19:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 17:19:25,636 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 17:19:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:25,636 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 17:19:25,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:19:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 17:19:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:19:25,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:25,637 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 17:19:25,637 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:25,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-12-03 17:19:25,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:25,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:25,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:27,882 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 17:19:27,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:27,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:27,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:27,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:27,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:27,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:19:27,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:27,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:27,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:27,937 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 17:19:27,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:34,770 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 17:19:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:19:34,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:34,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:19:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:19:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:19:34,790 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 17:19:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:34,897 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 17:19:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:19:34,897 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 17:19:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:34,898 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:19:34,898 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:19:34,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:19:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:19:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:19:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:19:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 17:19:34,902 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 17:19:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:34,903 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 17:19:34,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:19:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 17:19:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:19:34,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:34,903 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 17:19:34,903 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:34,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-12-03 17:19:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:34,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:34,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:37,497 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 17:19:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:37,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:37,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:37,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:37,497 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 17:19:37,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:19:37,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:19:37,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 17:19:37,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:37,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:37,581 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 17:19:37,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:45,196 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 17:19:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:19:45,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:45,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:19:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:19:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:19:45,216 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 17:19:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:45,442 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 17:19:45,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:19:45,442 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 17:19:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:45,443 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:19:45,443 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:19:45,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:19:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:19:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:19:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:19:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 17:19:45,445 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 17:19:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:45,446 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 17:19:45,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:19:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 17:19:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:19:45,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:45,446 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 17:19:45,446 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:45,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-12-03 17:19:45,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:45,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:45,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:48,065 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 17:19:48,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:48,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:48,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:48,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:48,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:48,065 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 17:19:48,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:19:48,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:19:48,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:19:48,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:48,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:48,126 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 17:19:48,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:55,259 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 17:19:55,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:55,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:19:55,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:55,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:19:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:19:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:19:55,280 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 17:19:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:55,432 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 17:19:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:19:55,433 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 17:19:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:55,434 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:19:55,434 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:19:55,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:19:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:19:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:19:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:19:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 17:19:55,437 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 17:19:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:55,437 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 17:19:55,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:19:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 17:19:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:19:55,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:55,437 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 17:19:55,438 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:55,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-12-03 17:19:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:55,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:55,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:58,152 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 17:19:58,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:58,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:58,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:58,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:58,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:58,153 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 17:19:58,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:58,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:58,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:58,215 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 17:19:58,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:06,953 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 17:20:06,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:20:06,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:06,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:20:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:20:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:20:06,974 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 17:20:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:07,197 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 17:20:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:20:07,198 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 17:20:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:07,199 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:20:07,199 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:20:07,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:20:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:20:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:20:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:20:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 17:20:07,201 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 17:20:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:07,202 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 17:20:07,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:20:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 17:20:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:20:07,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:07,202 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 17:20:07,203 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:07,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-12-03 17:20:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:07,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:07,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:07,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:09,817 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 17:20:09,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:09,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:09,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:09,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:09,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:09,817 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 17:20:09,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:20:09,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:20:09,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 17:20:09,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:09,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:09,897 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 17:20:09,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:17,409 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 17:20:17,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:17,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:20:17,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:17,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:20:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:20:17,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:20:17,429 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 17:20:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:17,571 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 17:20:17,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:20:17,571 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 17:20:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:17,572 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:20:17,572 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:20:17,574 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 17:20:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:20:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:20:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:20:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 17:20:17,576 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 17:20:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:17,577 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 17:20:17,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:20:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 17:20:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:20:17,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:17,578 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 17:20:17,578 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:17,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-12-03 17:20:17,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:17,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:17,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:17,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:17,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:20,087 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 17:20:20,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:20,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:20,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:20,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:20,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:20,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:20:20,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:20:20,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:20:20,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:20:20,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:20,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:20,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 17:20:20,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:28,155 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 17:20:28,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:28,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:20:28,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:28,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:20:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:20:28,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:20:28,176 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 17:20:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:28,334 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 17:20:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:20:28,334 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 17:20:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:28,335 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:20:28,335 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:20:28,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:20:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:20:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:20:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:20:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 17:20:28,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 17:20:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:28,340 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 17:20:28,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:20:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 17:20:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:20:28,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:28,341 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 17:20:28,341 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:28,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-12-03 17:20:28,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:28,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:28,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:30,932 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 17:20:30,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:30,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:30,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:30,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:30,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:30,933 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 17:20:30,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:30,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:20:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:30,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:30,993 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 17:20:30,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:39,077 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 17:20:39,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:20:39,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:39,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:20:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:20:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:20:39,099 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 17:20:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:39,286 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 17:20:39,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:20:39,287 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 17:20:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:39,288 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:20:39,288 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:20:39,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:20:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:20:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:20:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:20:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 17:20:39,292 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 17:20:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:39,292 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 17:20:39,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:20:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 17:20:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:20:39,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:39,293 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 17:20:39,293 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:39,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-12-03 17:20:39,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:39,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:39,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:39,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:39,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:42,167 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 17:20:42,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:42,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:42,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:42,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:42,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:42,168 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 17:20:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:20:42,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:20:42,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:20:42,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:42,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:42,250 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 17:20:42,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:50,410 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 17:20:50,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:50,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:20:50,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:50,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:20:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:20:50,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:20:50,432 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 17:20:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:50,626 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 17:20:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:20:50,626 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 17:20:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:50,627 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:20:50,627 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:20:50,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:20:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:20:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:20:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:20:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 17:20:50,631 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 17:20:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:50,631 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 17:20:50,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:20:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 17:20:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:20:50,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:50,631 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 17:20:50,632 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:50,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:50,632 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-12-03 17:20:50,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:50,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:50,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:53,745 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 17:20:53,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:53,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:53,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:53,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:53,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:53,746 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 17:20:53,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:20:53,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:20:53,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:20:53,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:53,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:53,818 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 17:20:53,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:02,023 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 17:21:02,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:02,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:21:02,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:02,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:21:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:21:02,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:21:02,044 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 17:21:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:02,262 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 17:21:02,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:21:02,262 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 17:21:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:02,263 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:21:02,263 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:21:02,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:21:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:21:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:21:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:21:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 17:21:02,267 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 17:21:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:02,267 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 17:21:02,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:21:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 17:21:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:21:02,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:02,268 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 17:21:02,268 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:02,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-12-03 17:21:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:02,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:21:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:02,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:05,075 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 17:21:05,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:05,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:05,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:05,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:21:05,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:05,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:21:05,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:05,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:05,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:05,136 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 17:21:05,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:13,806 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 17:21:13,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:13,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:21:13,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:13,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:21:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:21:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:21:13,828 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 17:21:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:14,049 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 17:21:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:21:14,050 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 17:21:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:14,050 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:21:14,051 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:21:14,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:21:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:21:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:21:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:21:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 17:21:14,054 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 17:21:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:14,054 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 17:21:14,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:21:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 17:21:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:21:14,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:14,055 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 17:21:14,055 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:14,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-12-03 17:21:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:14,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:14,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:16,886 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 17:21:16,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:16,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:16,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:16,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:21:16,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:16,887 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 17:21:16,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:21:16,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:21:17,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:21:17,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:21:17,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:17,043 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 17:21:17,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:25,830 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 17:21:25,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:25,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:21:25,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:25,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:21:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:21:25,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:21:25,851 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 17:21:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:25,996 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 17:21:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:21:25,996 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 17:21:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:25,997 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:21:25,997 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:21:25,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:21:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:21:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:21:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:21:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 17:21:26,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 17:21:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:26,001 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 17:21:26,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:21:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 17:21:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:21:26,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:26,002 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 17:21:26,002 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:26,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-12-03 17:21:26,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:26,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:26,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:21:26,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:26,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:29,289 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 17:21:29,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:29,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:29,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:29,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 17:21:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:29,290 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 17:21:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:21:29,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:21:29,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:21:29,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:21:29,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:29,353 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 17:21:29,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:38,083 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 17:21:38,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:38,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:21:38,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:38,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:21:38,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:21:38,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:21:38,104 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 17:21:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:38,404 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 17:21:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:21:38,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 17:21:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:38,405 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:21:38,406 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:21:38,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:21:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:21:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:21:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:21:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 17:21:38,410 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 17:21:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:38,410 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 17:21:38,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:21:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 17:21:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:21:38,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:38,411 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 17:21:38,411 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:38,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-12-03 17:21:38,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:38,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:38,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:21:38,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:38,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:41,386 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 17:21:41,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:41,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:41,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:41,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 17:21:41,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:41,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 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 17:21:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:41,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:41,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:41,450 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 17:21:41,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:50,609 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 17:21:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:21:50,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:50,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:21:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:21:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:21:50,631 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 17:21:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:50,815 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 17:21:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:21:50,816 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 17:21:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:50,817 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:21:50,817 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:21:50,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:21:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:21:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:21:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:21:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 17:21:50,819 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 17:21:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:50,820 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 17:21:50,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:21:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 17:21:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:21:50,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:50,820 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 17:21:50,820 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-12-03 17:21:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:50,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:50,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:54,232 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 17:21:54,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:54,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:54,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:54,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:21:54,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:54,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:21:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:21:54,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:21:54,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 17:21:54,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:21:54,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:54,316 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 17:21:54,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:03,631 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 17:22:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:22:03,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:03,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:22:03,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:22:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:22:03,651 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 17:22:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:03,886 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 17:22:03,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:22:03,887 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 17:22:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:03,887 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:22:03,887 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:22:03,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:22:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:22:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:22:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:22:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 17:22:03,890 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 17:22:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:03,890 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 17:22:03,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:22:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 17:22:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:22:03,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:03,891 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 17:22:03,891 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:03,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-12-03 17:22:03,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:03,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:22:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:03,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:06,967 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 17:22:06,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:06,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:06,968 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:06,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 17:22:06,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:06,968 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 17:22:06,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:22:06,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:22:07,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:22:07,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:22:07,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:07,049 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 17:22:07,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:16,662 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 17:22:16,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:16,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:22:16,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:16,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:22:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:22:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:22:16,682 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 17:22:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:16,813 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 17:22:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:22:16,814 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 17:22:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:16,815 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:22:16,815 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:22:16,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:22:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:22:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:22:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:22:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 17:22:16,819 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 17:22:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:16,819 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 17:22:16,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:22:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 17:22:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:22:16,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:16,820 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 17:22:16,820 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:16,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-12-03 17:22:16,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:16,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:22:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:16,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:20,250 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 17:22:20,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:20,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:20,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:20,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:22:20,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:20,251 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 17:22:20,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:20,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:22:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:20,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:20,322 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 17:22:20,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:30,009 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 17:22:30,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:30,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:22:30,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:30,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:22:30,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:22:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:22:30,030 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 17:22:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:30,174 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 17:22:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:22:30,174 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 17:22:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:30,175 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:22:30,175 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:22:30,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:22:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:22:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:22:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:22:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 17:22:30,178 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 17:22:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:30,178 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 17:22:30,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:22:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 17:22:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:22:30,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:30,179 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 17:22:30,179 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:30,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-12-03 17:22:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:30,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:33,438 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 17:22:33,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:33,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:33,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:33,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:22:33,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:33,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:22:33,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:22:33,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:22:33,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 17:22:33,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:22:33,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:33,528 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 17:22:33,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:43,547 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 17:22:43,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:43,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:22:43,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:43,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:22:43,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:22:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:22:43,568 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 17:22:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:43,731 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 17:22:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:22:43,731 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 17:22:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:43,732 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:22:43,732 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:22:43,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:22:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:22:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:22:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:22:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 17:22:43,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 17:22:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:43,736 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 17:22:43,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:22:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 17:22:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:22:43,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:43,737 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 17:22:43,737 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:43,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-12-03 17:22:43,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:43,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:43,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:22:43,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:43,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:47,255 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 17:22:47,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:47,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:47,255 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:47,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:22:47,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:47,256 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 17:22:47,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:22:47,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:22:47,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:22:47,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:22:47,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:47,333 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 17:22:47,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:57,289 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 17:22:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:57,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:22:57,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:57,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:22:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:22:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:22:57,310 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 17:22:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:57,518 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 17:22:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:22:57,518 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 17:22:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:57,519 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:22:57,519 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:22:57,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:22:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:22:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:22:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:22:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 17:22:57,523 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 17:22:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:57,523 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 17:22:57,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:22:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 17:22:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:22:57,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:57,524 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 17:22:57,524 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:57,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-12-03 17:22:57,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:57,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:22:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:57,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:01,206 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 17:23:01,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:01,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:01,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:01,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:01,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:01,207 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 17:23:01,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:01,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:01,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:01,273 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 17:23:01,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:11,576 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 17:23:11,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:11,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:23:11,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:11,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:23:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:23:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:23:11,606 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 17:23:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:11,907 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 17:23:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:23:11,907 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 17:23:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:11,908 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:23:11,908 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:23:11,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:23:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:23:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:23:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:23:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 17:23:11,912 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 17:23:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:11,912 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 17:23:11,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:23:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 17:23:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:23:11,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:11,913 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 17:23:11,913 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:11,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:11,913 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-12-03 17:23:11,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:11,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:11,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:15,697 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 17:23:15,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:15,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:15,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:15,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:15,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:15,698 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 17:23:15,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:23:15,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:23:15,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:23:15,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:23:15,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:15,789 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 17:23:15,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:26,125 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 17:23:26,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:26,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:23:26,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:26,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:23:26,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:23:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:23:26,147 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 17:23:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:26,378 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 17:23:26,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:23:26,378 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 17:23:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:26,379 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:23:26,379 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:23:26,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:23:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:23:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:23:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:23:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 17:23:26,384 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 17:23:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:26,384 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 17:23:26,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:23:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 17:23:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:23:26,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:26,385 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 17:23:26,385 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:26,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-12-03 17:23:26,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:26,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:23:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:26,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:29,887 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 17:23:29,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:29,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:29,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:29,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 17:23:29,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:29,888 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 17:23:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:23:29,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:23:29,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:23:29,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:23:29,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:29,967 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 17:23:29,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:40,701 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 17:23:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:23:40,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:40,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:23:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:23:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:23:40,722 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 17:23:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:41,042 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 17:23:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:23:41,043 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 17:23:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:41,043 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:23:41,043 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:23:41,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:23:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:23:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:23:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:23:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 17:23:41,047 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 17:23:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:41,048 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 17:23:41,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:23:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 17:23:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:23:41,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:41,048 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 17:23:41,048 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:41,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-12-03 17:23:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:41,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:23:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:41,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:44,654 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 17:23:44,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:44,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:44,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:44,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:44,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:44,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:23:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:44,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:44,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:44,721 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 17:23:44,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:55,545 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 17:23:55,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:55,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:23:55,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:55,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:23:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:23:55,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:23:55,566 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 17:23:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:55,749 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 17:23:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:23:55,749 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 17:23:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:55,750 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:23:55,751 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:23:55,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:23:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:23:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:23:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:23:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 17:23:55,755 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 17:23:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:55,755 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 17:23:55,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:23:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 17:23:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:23:55,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:55,756 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 17:23:55,757 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:55,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-12-03 17:23:55,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:55,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:59,641 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 17:23:59,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:59,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:59,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:59,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:59,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:59,642 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 17:23:59,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:23:59,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:23:59,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:23:59,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:23:59,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:59,746 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 17:23:59,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:10,882 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 17:24:10,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:10,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:24:10,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:10,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:24:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:24:10,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:24:10,906 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 17:24:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:11,251 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 17:24:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:24:11,252 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 17:24:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:11,253 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:24:11,253 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:24:11,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:24:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:24:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:24:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:24:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 17:24:11,258 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 17:24:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:11,258 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 17:24:11,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:24:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 17:24:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:24:11,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:11,259 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 17:24:11,259 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:11,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-12-03 17:24:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:11,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:24:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:11,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:15,199 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 17:24:15,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:15,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:15,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:24:15,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:24:15,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:15,200 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 17:24:15,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:24:15,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:24:15,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:24:15,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:24:15,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:15,290 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 17:24:15,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:26,744 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 17:24:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:26,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:24:26,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:26,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:24:26,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:24:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:24:26,767 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 17:24:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:27,102 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 17:24:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:24:27,102 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 17:24:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:27,103 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:24:27,103 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:24:27,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:24:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:24:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:24:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:24:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 17:24:27,107 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 17:24:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:27,107 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 17:24:27,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:24:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 17:24:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:24:27,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:27,108 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 17:24:27,108 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:27,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-12-03 17:24:27,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:27,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:27,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:24:27,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:27,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:30,914 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 17:24:30,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:30,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:30,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:24:30,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:24:30,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:30,914 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 17:24:30,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:30,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:24:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:30,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:30,992 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 17:24:30,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:42,778 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 17:24:42,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:42,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:24:42,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:42,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:24:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:24:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:24:42,800 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 17:24:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:43,028 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 17:24:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:24:43,028 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 17:24:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:43,029 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:24:43,029 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:24:43,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:24:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:24:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:24:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:24:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 17:24:43,034 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 17:24:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:43,034 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 17:24:43,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:24:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 17:24:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:24:43,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:43,035 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 17:24:43,035 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:43,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-12-03 17:24:43,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:43,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:43,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:43,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:43,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:46,940 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 17:24:46,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:46,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:46,941 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:24:46,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:24:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:46,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:24:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:24:46,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:24:47,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 17:24:47,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:24:47,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:47,047 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 17:24:47,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:59,018 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 17:24:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:24:59,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:59,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:24:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:24:59,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:24:59,040 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 17:24:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:59,269 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 17:24:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:24:59,270 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 17:24:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:59,271 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:24:59,271 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:24:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:24:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:24:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:24:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:24:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 17:24:59,275 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 17:24:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:59,275 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 17:24:59,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:24:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 17:24:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:24:59,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:59,275 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 17:24:59,276 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:59,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-12-03 17:24:59,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:59,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:59,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:24:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:59,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:03,476 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 17:25:03,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:03,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:03,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:03,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:25:03,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:03,477 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 17:25:03,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:25:03,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:25:03,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:25:03,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:25:03,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:03,550 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 17:25:03,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:15,487 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 17:25:15,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:15,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:25:15,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:15,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:25:15,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:25:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:25:15,508 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 17:25:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:15,739 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 17:25:15,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:25:15,739 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 17:25:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:15,740 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:25:15,740 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:25:15,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:25:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:25:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:25:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:25:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 17:25:15,745 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 17:25:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:15,745 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 17:25:15,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:25:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 17:25:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:25:15,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:15,746 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 17:25:15,746 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:15,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-12-03 17:25:15,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:15,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:15,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:25:15,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:15,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:20,032 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 17:25:20,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:20,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:20,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:20,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:25:20,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:20,033 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 17:25:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:20,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:25:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:20,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:20,119 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 17:25:20,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:32,492 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 17:25:32,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:32,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:25:32,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:32,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:25:32,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:25:32,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:25:32,513 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 17:25:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:32,767 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 17:25:32,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:25:32,768 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 17:25:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:32,768 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:25:32,768 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:25:32,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:25:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:25:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:25:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:25:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 17:25:32,772 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 17:25:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:32,772 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 17:25:32,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:25:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 17:25:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:25:32,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:32,773 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 17:25:32,774 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:32,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-12-03 17:25:32,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:32,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:32,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:32,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:32,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:37,085 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 17:25:37,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:37,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:37,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:37,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:25:37,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:37,086 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 17:25:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:25:37,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:25:37,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 17:25:37,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:25:37,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:37,186 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 17:25:37,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:49,850 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 17:25:49,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:49,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:25:49,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:49,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:25:49,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:25:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:25:49,873 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 17:25:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:50,196 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 17:25:50,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:25:50,196 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 17:25:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:50,197 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:25:50,197 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:25:50,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:25:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:25:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:25:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:25:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:25:50,202 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 17:25:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:50,202 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:25:50,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:25:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:25:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:25:50,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:50,203 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 17:25:50,203 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:50,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-12-03 17:25:50,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:50,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:25:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:50,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:54,501 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 17:25:54,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:54,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:54,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:54,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:25:54,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:54,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:25:54,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:25:54,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:25:54,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:25:54,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:25:54,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:54,573 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 17:25:54,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:07,172 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 17:26:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:07,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:26:07,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:07,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:26:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:26:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:26:07,195 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 17:26:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:07,475 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 17:26:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:26:07,476 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 17:26:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:07,477 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:26:07,477 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:26:07,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:26:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:26:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:26:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:26:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 17:26:07,482 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 17:26:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:07,482 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 17:26:07,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:26:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 17:26:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:26:07,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:07,483 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 17:26:07,483 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:07,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-12-03 17:26:07,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:07,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:07,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:07,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:07,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:12,015 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 17:26:12,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:12,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:12,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:12,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:12,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:12,016 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 17:26:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:12,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:12,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:12,096 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 17:26:12,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:25,294 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 17:26:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:25,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:26:25,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:25,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:26:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:26:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:26:25,316 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 17:26:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:25,533 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 17:26:25,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:26:25,533 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 17:26:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:25,534 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:26:25,534 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:26:25,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:26:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:26:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:26:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:26:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:26:25,538 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 17:26:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:25,539 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:26:25,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:26:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:26:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:26:25,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:25,540 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 17:26:25,540 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:25,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:25,540 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-12-03 17:26:25,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:25,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:25,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:30,105 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 17:26:30,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:30,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:30,106 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:30,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:30,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:30,106 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 17:26:30,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:30,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:30,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 17:26:30,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:30,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:30,216 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 17:26:30,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:43,450 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 17:26:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:43,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 17:26:43,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:43,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 17:26:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 17:26:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:26:43,471 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 17:26:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:43,828 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 17:26:43,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 17:26:43,828 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 17:26:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:43,829 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:26:43,829 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:26:43,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:26:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:26:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 17:26:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:26:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 17:26:43,834 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 17:26:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:43,834 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 17:26:43,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 17:26:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 17:26:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:26:43,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:43,835 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 17:26:43,835 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:43,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2018-12-03 17:26:43,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:43,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:43,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:48,417 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 17:26:48,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:48,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:48,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:48,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:48,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:48,418 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 17:26:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:48,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:48,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:48,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:48,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:48,495 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 17:26:48,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:02,235 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 17:27:02,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:02,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 17:27:02,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:02,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 17:27:02,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 17:27:02,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 17:27:02,256 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-03 17:27:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:02,563 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 17:27:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 17:27:02,563 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-03 17:27:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:02,564 INFO L225 Difference]: With dead ends: 118 [2018-12-03 17:27:02,564 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:27:02,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 17:27:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:27:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 17:27:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:27:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 17:27:02,568 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-03 17:27:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:02,569 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 17:27:02,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 17:27:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 17:27:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:27:02,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:02,569 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-03 17:27:02,570 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:02,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2018-12-03 17:27:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:07,343 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 17:27:07,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:07,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:07,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:07,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:07,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:07,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:27:07,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:07,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:07,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:07,426 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 17:27:07,426 INFO L316 TraceCheckSpWp]: Computing backward predicates...